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!)
A048634 a(n) = a(n-1)*a(n-3) + a(n-2), with a(0)=a(1)=0 and a(2)=1. 3
0, 0, 1, 0, 1, 1, 1, 2, 3, 5, 13, 44, 233, 3073, 135445, 31561758, 96989417779, 13136731722638413, 414618347540933702027833, 40213592128486236142855326045681320, 528275171395527518169753769210241662354568290572993 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
a(n) ~ c^(A092526^n), where c = A344388 = 1.0574735961... (very close to A201506). - Vaclav Kotesovec, Aug 16 2021
MAPLE
A048634 := proc(n) option remember; if n<=1 then 0 elif n=2 then 1 else A048634(n-1)*A048634(n-3)+A048634(n-2); fi; end;
MATHEMATICA
RecurrenceTable[{a[n] == a[n-1]*a[n-3] + a[n-2], a[0] == 0, a[1] == 0, a[2] == 1}, a, {n, 0, 20}] (* Vaclav Kotesovec, Aug 16 2021 *)
CROSSREFS
Sequence in context: A093999 A042445 A332060 * A012899 A215102 A110364
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, David(AT)interface.co.uk
EXTENSIONS
Name clarified by Michel Marcus, Aug 16 2021
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 June 21 03:23 EDT 2024. Contains 373535 sequences. (Running on oeis4.)