|
|
A112980
|
|
a(0) = 0, a(1) = 1; for n>=2: a(n) = a(n-1)^5 + a(n-2)^5.
|
|
0
|
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
A quintic Fibonacci sequence.
This is the quintic analog of the Fibonacci sequence similarly to A000283 being the quadratic analog of the Fibonacci sequence. In base 10, n^5 has the same rightmost digit as n. a(7) has 190 digits.
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 1^5 + 1^5 = 2.
a(4) = 1^5 + 2^5 = 33.
a(5) = 2^5 + 33^5 = 39135425.
a(6) = 33^5 + 39135425^5 = 91801604643057285538237803582627026018.
|
|
MATHEMATICA
|
RecurrenceTable[{a[1]==a[2]==1, a[n]==a[n-1]^5+a[n-2]^5}, a, {n, 7}] (* Harvey P. Dale, May 01 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|