login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #2 Jan 09 2009 03:00:00

%S 1,1,3,4,5,9,7,16,9,25,11,36,13,49,15,23,120,14,52,88,33,80,21,112,

%T 102,152,30,224,165,136,105,7,636,309,304,252,103,1275,217,117,391,

%U 2004,489,637,195,556,1736,500,91,1971,440,251,4809,1216,291,3796,53,3969

%N 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.

%e 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

%K nonn

%O 0,3

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)