OFFSET
0,5
COMMENTS
Let k be a positive integer. It appears that reducing this sequence modulo k produces an eventually periodic sequence with period a multiple of k. For example, modulo 3 the sequence becomes [1, 1, 1, 0, 2, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 2, 1, 0, ...], with an apparent period [1, 1, 0, 2, 1, 0] of length 6 starting at a(1). - Peter Bala, Apr 16 2023
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..428
Eric Weisstein's World of Mathematics, Lambert W-Function.
FORMULA
a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/3)} A362292(k) * binomial(n-1,3*k) * a(n-3*k-1).
a(n) ~ (1 + 2*cos(2*Pi*mod(n-1,3)/3 - sqrt(3)/2)/exp(3/2)) * n^(n-1) / (sqrt(3) * exp(2*n/3 - 1)). - Vaclav Kotesovec, Apr 18 2023
PROG
(PARI) my(N=30, x='x+O('x^N)); Vec(serlaplace(exp((-lambertw(-x^3))^(1/3))))
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 14 2023
STATUS
approved