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!)
A238590 Number of partitions p of n such that 3*min(p) is a part of p. 3
0, 0, 0, 1, 1, 2, 3, 6, 7, 12, 16, 25, 32, 46, 61, 86, 110, 149, 192, 257, 326, 425, 538, 694, 871, 1107, 1381, 1740, 2154, 2689, 3313, 4103, 5024, 6176, 7529, 9201, 11157, 13554, 16365, 19784, 23782, 28610, 34260, 41039, 48958, 58405, 69431, 82525, 97775 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

EXAMPLE

a(7) = 3 counts these partitions:  331, 3211, 31111.

MAPLE

b:= proc(n, i) option remember; `if`(n=0, 1,

      `if`(i>n, 0, b(n, i+1)+b(n-i, i)))

    end:

a:= n-> add(b(n-4*i, i), i=1..n/4):

seq(a(n), n=1..60);  # Alois P. Heinz, Mar 03 2014

MATHEMATICA

Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, 3*Min[p]]], {n, 50}]

CROSSREFS

Cf. A238589, A238591.

Sequence in context: A130404 A064689 A240175 * A144120 A073712 A157200

Adjacent sequences:  A238587 A238588 A238589 * A238591 A238592 A238593

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Mar 01 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 July 11 00:56 EDT 2020. Contains 335600 sequences. (Running on oeis4.)