The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065336 a(0) = 1; thereafter, a(n) is the smallest number such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square. 1
 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; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS 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: A302653 A300738 A324506 * A079097 A202475 A036710 Adjacent sequences:  A065333 A065334 A065335 * A065337 A065338 A065339 KEYWORD nonn AUTHOR Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 29 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 23:02 EDT 2020. Contains 336300 sequences. (Running on oeis4.)