login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A358547 a(n) = Sum_{k=0..floor(n/3)} (n-k)!/(n-3*k)!. 2
1, 1, 1, 3, 7, 13, 45, 151, 403, 1617, 6793, 23275, 105951, 522133, 2159077, 10964223, 61134955, 293587801, 1641566913, 10124731987, 55014334903, 335177088285, 2251814156701, 13587321392743, 89436553249347, 647267633012833, 4276528756374265, 30198747030078651 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = (3 * (2*n-1) * a(n-1) - n * a(n-2) + 2 * (n-1) * n * (2*n-3) * a(n-3) + 2 * (2*n-3))/(9 * (n-1)) for n > 2.
a(n) ~ sqrt(Pi) * 2^(2*n/3 + 1) * n^(2*n/3 + 1/2) / (3^(2*n/3 + 3/2) * exp(2*n/3 - (2/3)^(1/3) * n^(1/3))) * (1 + 1/(2^(4/3) * 3^(5/3) * n^(1/3)) + 145/(2^(11/3) * 3^(10/3) * n^(2/3)) + 3349/(23328*n)). - Vaclav Kotesovec, Nov 25 2022
PROG
(PARI) a(n) = sum(k=0, n\3, (n-k)!/(n-3*k)!);
CROSSREFS
Sequence in context: A086208 A090968 A020641 * A062736 A257716 A103564
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Nov 21 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)