[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 A103266 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A103266 Minimal number of squares needed to sum to Fibonacci(n+1).
(history; published version)
#20 by OEIS Server at Wed Nov 21 03:18:07 EST 2018
LINKS

Hans Havermann, <a href="/A103266/b103266_1.txt">Table of n, a(n) for n = 1..1400</a> (terms 1..465 from Antti Karttunen)

#19 by Joerg Arndt at Wed Nov 21 03:18:07 EST 2018
STATUS

reviewed

approved

Discussion
Wed Nov 21 03:18
OEIS Server: Installed new b-file as b103266.txt.  Old b-file is now b103266_1.txt.
#18 by Michel Marcus at Sat Nov 17 01:51:22 EST 2018
STATUS

proposed

reviewed

#17 by Antti Karttunen at Sat Nov 17 01:31:34 EST 2018
STATUS

editing

proposed

#16 by Antti Karttunen at Sat Nov 17 01:30:53 EST 2018
LINKS

AnttiHans KarttunenHavermann, <a href="/A103266/b103266_1.txt">Table of n, a(n) for n = 1..4651400</a>> (terms 1..465 from Antti Karttunen)

STATUS

approved

editing

Discussion
Sat Nov 17 01:31
Antti Karttunen: Hans kindly computed a larger b-file, and I downloaded it from http://chesswanks.com/seq/b103266.txt
#15 by Susanna Cuyler at Wed Nov 14 08:12:02 EST 2018
STATUS

proposed

approved

#14 by Jon E. Schoenfield at Tue Nov 13 22:35:07 EST 2018
STATUS

editing

proposed

#13 by Jon E. Schoenfield at Tue Nov 13 22:35:04 EST 2018
COMMENTS

Since every positive integer is the sum of four squares, no term is greater than 4. Also, since any positive integer not of the form 4^k(8m+7) is the sum 3 or fewer squares, the next occurrences of a(n)=4 are at n = 45, 57, 69, 81, 83, 93,.... - _, .... - _John W. Layman_, Mar 30 2005

STATUS

proposed

editing

#12 by Michael De Vlieger at Tue Nov 13 17:24:20 EST 2018
STATUS

editing

proposed

#11 by Michael De Vlieger at Tue Nov 13 17:24:15 EST 2018
MATHEMATICA

Array[If[First[#] > 0, 1, Length@ First@ Split@ # + 1] &@ SquaresR[Range@ 4, Fibonacci@ #] &, 50, 2] (* Michael De Vlieger, Nov 13 2018, after Harvey P. Dale at A002828 *)

STATUS

proposed

editing

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 31 15:16 EDT 2024. Contains 375572 sequences. (Running on oeis4.)