Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065336
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065336 a(n) is the smallest number such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square. +0
2
1, 1, 3, 4, 5, 9, 7, 16, 9, 25, 11, 36, 13, 49, 15, 23, 120, 14, 52, 88, 33, 80, 21, 112, 102, 152, 30, 224, 165, 136, 105, 7, 636, 309, 304, 252, 103, 1275, 217, 117, 391, 2004, 489, 637, 195, 556, 1736, 500, 91, 1971, 440, 251, 4809, 1216, 291, 3796, 53, 3969 (list; graph; listen)
OFFSET

0,3

EXAMPLE

a(4) = 5 because a(0)*a(1)+a(1)*a(2)+a(2)*a(3)+a(3)*a(4) = 1*1+1*3+3*4+4*5 = 36

CROSSREFS

Sequence in context: A020863 A122401 A122403 this_sequence A036710 A098801 A069807

Adjacent sequences: A065333 A065334 A065335 this_sequence A065337 A065338 A065339

KEYWORD

nonn

AUTHOR

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 29 2001

page 1

Search completed in 0.003 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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research