[go: up one dir, main page]

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!)
Revision History for A065336 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
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.
(history; published version)
#2 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
NAME

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.

KEYWORD

nonn,new

nonn

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
NAME

a(n) is the smallest number such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square.

DATA

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

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

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 21:29 EDT 2024. Contains 375550 sequences. (Running on oeis4.)