OFFSET
0,4
COMMENTS
A second quintic Fibonacci sequence; compare to A112980.
a(6) contains 190 digits and is too large to display here.
LINKS
Lyle Blosser, Table of n, a(n) for n = 0..7
Lyle Blosser, Python program to create b-file
FORMULA
a(n) = (a(n-1) + a(n-2))^5.
a(n) = A112980(n)^5.
EXAMPLE
a(3) = 32 = (1+1)^5 = A112980(3)^5.
MATHEMATICA
Module[{a, n}, RecurrenceTable[{a[0] == 0, a[1] == 1, a[n] == (a[n-1] + a[n-2])^5}, a, {n, 6}]] (* or *)
Array[A377596, 7, 0] (* Paolo Xausa, Nov 30 2024 *)
CROSSREFS
KEYWORD
nonn,easy,new
AUTHOR
Lyle Blosser, Nov 29 2024
STATUS
approved