|
| |
|
|
A099353
|
|
From P-positions in a certain game.
|
|
3
| |
|
|
0, 2, 7, 12, 18, 25, 35, 45, 56, 68, 83, 98, 114, 131, 149, 170, 191, 213, 236, 260, 285, 313, 341, 370, 400, 431, 463, 496, 530, 565, 603, 641, 680, 720, 761, 803, 846, 890, 935, 983, 1031, 1080, 1130, 1181, 1233, 1286, 1340, 1395, 1451, 1510, 1569
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Nathaniel Johnston, Table of n, a(n) for n = 0..10000
A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004.
|
|
|
FORMULA
| See A099352.
|
|
|
MAPLE
| a:=proc(n) option remember: local j, t: if(n=0)then return 0: else t:=a(n-1)+1: for j from 0 to n-1 do if(t=b(j))then return t+1: elif(t<b(j))then break: fi: od: return t: fi: end:
b:=proc(n) option remember: if(n=0)then return 0: else return b(n-1) + a(n) - floor((a(n-1)+1)/a(n)) + 2: fi: end:seq(b(n), n=0..50); # Nathaniel Johnston, Apr 28 2011
|
|
|
CROSSREFS
| Sequence in context: A016873 A019592 A131190 * A188039 A133459 A023669
Adjacent sequences: A099350 A099351 A099352 * A099354 A099355 A099356
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Nov 16 2004
|
| |
|
|
