|
|
A093332
|
|
a(0) = 0, a(1) = 1 and for n >=0, a(n+2) = int(sqrt(2 * (a(n)^2 + a(n+1)^2)))
|
|
2
|
|
|
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 56, 92, 152, 251, 414, 684, 1130, 1868, 3087, 5102, 8433, 13938, 23038, 38079, 62940, 104033, 171955, 284223, 469789, 776510, 1283487, 2121464, 3506550, 5795947, 9580072, 15834821, 26173243, 43261534, 71506628
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
First 10 terms are the same as the first 10 terms of the Fibonacci sequence (A000045).
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 5 because a(5) = int(sqrt(2* a(3)^2 + a(4)^2)) = int(sqrt(2*(2^2+3^2))) = int(sqrt(26) = 5.
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Robert A. Stump (rstump_2004(AT)yahoo.com), Apr 25 2004
|
|
STATUS
|
approved
|
|
|
|