|
Search: id:A114950
|
|
|
| A114950 |
|
A quartic quadratic recurrence. |
|
+0
1
|
|
| 1, 1, 2, 83525, 48670514501156640914, 5611303368570568119463158581109807779153712597124269146443734128560476495542441
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(6) has 315 digits. This sequence is related to: A112969 "quartic Fibonacci sequence" a(1) = a(2) = 1; for n>2: a(n) = a(n-1)^4 + a(n-2)^4, which is the quartic (or biquadratic) analogue of the Fibonacci sequence similarly to A000283 being the quadratic analogue of the Fibonacci sequence. Primes in this sequence include a(n) for n = 2, 3. Semiprimes in this sequence include a(n) for n = 5.
|
|
FORMULA
|
a(0) = a(1) = 1, for n>1 a(n) = a(n-2)^4 + a(n-1)^2.
|
|
EXAMPLE
|
a(2) = a(1)^4 + a(0)^2 = 1^4 + 1^2 = 2.
a(3) = a(2)^4 + a(1)^2 = 2^4 + 1^2 = 17.
a(4) = a(3)^4 + a(2)^2 = 17^4 + 2^2 = 83525.
a(5) = a(4)^4 + a(3)^2 = 83525^4 + 17^2 = 48670514501156640914.
|
|
CROSSREFS
|
Cf. A000283, A112969, A114793.
Sequence in context: A100266 A071067 A060069 this_sequence A003840 A122540 A006935
Adjacent sequences: A114947 A114948 A114949 this_sequence A114951 A114952 A114953
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com), Feb 21 2006
|
|
|
Search completed in 0.002 seconds
|
