Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093332
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093332 a(0) = 0, a(1) = 1 and for n >=0, a(n+2) = int(sqrt(2 * (a(n)^2 + a(n+1)^2))) +0
3
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; listen)
OFFSET

0,4

COMMENT

First 10 terms are the same as the first 10 terms of the Fibonacci sequence (A000045).

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

Cf. A000045, A093333, A093335.

Sequence in context: A005181 A120659 A042581 this_sequence A050762 A005170 A024322

Adjacent sequences: A093329 A093330 A093331 this_sequence A093333 A093334 A093335

KEYWORD

easy,nonn

AUTHOR

Robert A. Stump (rstump_2004(AT)yahoo.com), Apr 25 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research