login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237756 Number of partitions of n such that 3*(greatest part) = (number of parts). 1
0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 6, 7, 10, 10, 13, 14, 19, 21, 27, 31, 40, 45, 55, 64, 79, 91, 111, 127, 154, 177, 211, 243, 290, 333, 394, 455, 538, 618, 726, 834, 977, 1121, 1304, 1495, 1738, 1989, 2302, 2633, 3041, 3473, 3999, 4562, 5241 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

COMMENTS

Also, the number of partitions of n such that (greatest part) = 3*(number of parts).

LINKS

Table of n, a(n) for n=1..59.

EXAMPLE

a(15) = 4 counts these partitions: [12,1,1,1], [9,5,1], [9,4,2], [9,3,3].

MATHEMATICA

z = 50; Table[Count[IntegerPartitions[n], p_ /; Max[p] = = 3 Length[p]], {n, z}]

CROSSREFS

Cf. A064173, A237753.

Sequence in context: A214927 A326115 A239485 * A010334 A010578 A328583

Adjacent sequences:  A237753 A237754 A237755 * A237757 A237758 A237759

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Feb 13 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 04:37 EDT 2020. Contains 337392 sequences. (Running on oeis4.)