This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013189 All terms are squares and a(n) is length of n-th run. 3
 1, 4, 4, 4, 4, 9, 9, 9, 9, 16, 16, 16, 16, 25, 25, 25, 25, 36, 36, 36, 36, 36, 36, 36, 36, 36, 49, 49, 49, 49, 49, 49, 49, 49, 49, 64, 64, 64, 64, 64, 64, 64, 64, 64, 81, 81, 81, 81, 81, 81, 81, 81, 81, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Golomb's sequence using squares. - Benoit Cloitre, Apr 20 2003 LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 FORMULA n-th term, divided by n, tends to square root of two. MATHEMATICA f[s_] := Join@@Table[i^2, {i, Length[s]}, {s[[i]]}]; Nest[f, {1, 4}, 3] CROSSREFS Cf. A001462, A080605, A080606, A080607. Sequence in context: A124570 A213083 A053187 * A295643 A190718 A035621 Adjacent sequences:  A013186 A013187 A013188 * A013190 A013191 A013192 KEYWORD nonn,easy AUTHOR 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 April 20 22:22 EDT 2019. Contains 322310 sequences. (Running on oeis4.)