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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258462 Number of partitions of n into parts of exactly 7 sorts which are introduced in ascending order. 3
1, 29, 492, 6401, 70880, 704676, 6490951, 56524414, 471750267, 3810085912, 29989229859, 231255237311, 1754111872429, 13128442913712, 97189645384884, 713050007285941, 5192646586465458, 37581376345088462, 270593146237918806, 1939929376872664097 (list; graph; refs; listen; history; text; internal format)
OFFSET

7,2

LINKS

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

FORMULA

a(n) ~ c * 7^n, where c = 1/(7!*Product_{n>=1} (1-1/7^n)) = 1/(7!*QPochhammer[1/7, 1/7]) = 0.0002371101666331046535758625585353... . - Vaclav Kotesovec, Jun 01 2015

MAPLE

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

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

    end:

T:= (n, k)-> add(b(n$2, k-i)*(-1)^i/(i!*(k-i)!), i=0..k):

a:= n-> T(n, 7):

seq(a(n), n=7..30);

CROSSREFS

Column k=7 of A256130.

Cf. A320549.

Sequence in context: A182014 A261540 A173986 * A320550 A211833 A022753

Adjacent sequences:  A258459 A258460 A258461 * A258463 A258464 A258465

KEYWORD

nonn

AUTHOR

Alois P. Heinz, May 30 2015

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 January 23 19:45 EST 2020. Contains 331175 sequences. (Running on oeis4.)