Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a241068 -id:a241068
Displaying 1-2 of 2 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A241065 Number of partitions p of n into distinct parts such that max(p) < -1 + 2*min(p). +10
3
0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 4, 3, 3, 4, 5, 4, 5, 5, 6, 6, 7, 7, 8, 8, 8, 10, 11, 10, 12, 12, 13, 14, 15, 16, 17, 19, 18, 20, 22, 22, 25, 26, 27, 29, 30, 32, 34, 36, 37, 41, 43, 44, 47, 50, 51, 55, 58, 60, 65, 68, 70, 75, 78, 82, 85, 91 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
EXAMPLE
a(17) counts these 3 partitions: {17}, {10, 7}, {9,8}.
MATHEMATICA
z = 70; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &];
Table[Count[f[n], p_ /; Max[p] < -1 + 2*Min[p]], {n, 0, z}] (* A241065 *)
Table[Count[f[n], p_ /; Max[p] <= -1 + 2*Min[p]], {n, 0, z}] (* A240874 *)
Table[Count[f[n], p_ /; Max[p] == -1 + 2*Min[p]], {n, 0, z}] (* A241067 *)
Table[Count[f[n], p_ /; Max[p] >= -1 + 2*Min[p]], {n, 0, z}] (* A241068 *)
Table[Count[f[n], p_ /; Max[p] > -1 + 2*Min[p]], {n, 0, z}] (* A241036 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 16 2014
STATUS
approved
A241067 Number of partitions p of n into distinct parts such that max(p) = -1 + 2*min(p). +10
3
0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 2, 0, 0, 2, 1, 2, 1, 1, 1, 2, 2, 2, 3, 1, 1, 4, 2, 3, 4, 3, 3, 3, 3, 4, 6, 5, 4, 6, 4, 5, 7, 6, 7, 8, 8, 8, 9, 7, 8, 11, 11, 11, 13, 12, 12, 15, 12, 14, 17, 15, 18, 19, 20, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,18
LINKS
EXAMPLE
a(17) counts these 2 partitions: {11,6}, {7,6,4}.
MATHEMATICA
z = 70; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &];
Table[Count[f[n], p_ /; Max[p] < -1 + 2*Min[p]], {n, 0, z}] (* A241065 *)
Table[Count[f[n], p_ /; Max[p] <= -1 + 2*Min[p]], {n, 0, z}] (* A240874 *)
Table[Count[f[n], p_ /; Max[p] == -1 + 2*Min[p]], {n, 0, z}] (* A241067 *)
Table[Count[f[n], p_ /; Max[p] >= -1 + 2*Min[p]], {n, 0, z}] (* A241068 *)
Table[Count[f[n], p_ /; Max[p] > -1 + 2*Min[p]], {n, 0, z}] (* A241036 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 16 2014
STATUS
approved
page 1

Search completed in 0.006 seconds

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 20:16 EDT 2024. Contains 375353 sequences. (Running on oeis4.)