comment
Closed form for the A110501 (unsigned Genocchi numbers (of first kind) of even index)
Thank you for answer! What do you think about $$a(n) = \sum\limits_{i=1}^{n}i((i-1)!)^2T(n, i)(-1)^{n-i}.$$?
Loading…
revised
Fast and simple algorithm for the A329369
added 1 character in body
Loading…
Loading…
awarded
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
deleted 268 characters in body
Loading…
revised
Loading…
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
added 151 characters in body
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
added 1225 characters in body
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
deleted 20 characters in body; edited body
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
added 4 characters in body
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
added 1378 characters in body
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
added 8 characters in body
Loading…
revised
Searching for a proof of the pattern and identification of integer coefficients for the A329369
added 246 characters in body
Loading…
asked
Loading…
comment
Correctness of the algorithm for the A329369, A347205 and related sequences
If I understand correctly, you are just recursively calculating the first $N$ values. The code from my question allows you to calculate an individual term for very large $N$ without resorting to ordinary recursion, but using small vectors.