|
|
A293013
|
|
a(n) = n! * [x^n] exp(x/(1 - x)^n).
|
|
4
|
|
|
1, 1, 5, 55, 961, 24101, 818821, 36053515, 1984670465, 132825475081, 10583425959301, 988018789759871, 106673677280748865, 13172700275176482925, 1842428769970603518341, 289406832942160060794451, 50677793314733587473331201, 9829328870566195730521433105
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Conjecture: a(n+k) == a(n) (mod k) for all n and k. If true, then for each k, the sequence a(n) taken modulo k is a periodic sequence and the period divides k. - Peter Bala, Mar 12 2023
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[n! SeriesCoefficient[Exp[x/(1 - x)^n] , {x, 0, n}], {n, 0, 17}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|