|
Search: id:A013189
|
|
|
| A013189 |
|
All terms are squares and a(n) is length of n-th run. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Golomb's sequence using squares. - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 20 2003
|
|
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: A114555 A124570 A053187 this_sequence A035621 A046109 A107680
Adjacent sequences: A013186 A013187 A013188 this_sequence A013190 A013191 A013192
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Jim Propp (propp(AT)math.wisc.edu)
|
|
|
Search completed in 0.002 seconds
|
