|
Search: id:A118550
|
|
|
| A118550 |
|
a(0)=1; a(n) = a(n-1) + n if n is in the sequence, a(n) = a(n-1) + 1 if n is missing from the sequence. |
|
+0
1
|
|
| 1, 2, 4, 5, 9, 14, 15, 16, 17, 26, 27, 28, 29, 30, 44, 59, 75, 92, 93, 94, 95, 96, 97, 98, 99, 100, 126, 153, 181, 210, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
MATHEMATICA
|
f[s_] := Block[{n = Length@s}, Append[s, If[ MemberQ[s, n], 2s[[ -1]], s[[ -1]] + 1]]]; Nest[f, {1}, 60] - Robert G. Wilson v (rgwv(at)rgwv.com), May 17 2006
|
|
CROSSREFS
|
Sequence in context: A068372 A068370 A060167 this_sequence A126697 A129282 A073153
Adjacent sequences: A118547 A118548 A118549 this_sequence A118551 A118552 A118553
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), May 03 2006
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), May 17 2006
|
|
|
Search completed in 0.002 seconds
|
