|
| |
|
|
A071623
|
|
Least k such that n = A071532(k).
|
|
1
| |
|
|
1, 4, 5, 6, 7, 8, 15, 18, 21, 22, 35, 64, 65, 130, 131, 160, 161, 170, 175, 186, 187, 190, 391, 392, 393, 508, 511, 514, 515, 516, 519, 530, 535, 536, 539, 540, 543, 552, 553, 566, 577, 584, 587, 588, 593, 594, 627, 630, 631, 636
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| For some n, a(n+1)-a(n)=1.
|
|
|
PROG
| (PARI) for(n=1, 50, s=1; while(abs(n+sum(i=1, s, sign((-1)^floor((3/2)^i))))>0, s++); print1(s, ", "))
|
|
|
CROSSREFS
| Cf. A071532.
Sequence in context: A047567 A050038 A059709 * A140293 A075341 A143789
Adjacent sequences: A071620 A071621 A071622 * A071624 A071625 A071626
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 2002
|
| |
|
|
