|
Search: id:A084229
|
|
|
| A084229 |
|
Let b(1)=1, b(2)=2, b(n) = sum of digits of b(1)+b(2)+b(3)+...+b(n-1), sequence gives values of n such that b(n)=3. |
|
+0
1
|
|
| 3, 5, 7, 9, 17, 19, 27, 29, 87, 95, 97, 159, 591, 599, 601, 663, 1143, 4609, 4617, 4619, 4681, 5161
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
b(k)==0 (mod 3) n>2.
|
|
FORMULA
|
Conjecture : a(n)/n^3 is bounded.
|
|
PROGRAM
|
(PARI) // sumdig(n)=sum(k=0, ceil(log(n)/log(10)), floor(n/10^k)%10) // an=vector(10000); a(n)=if(n<0, 0, an[n]) // an[1]=1; an[2]=2; for(n=3, 5300, an[n]=sumdig(sum(k=1, n-1, a(k)))) // for(n=1, 5300, if(a(n)==3, print1(n, ", ")))
|
|
CROSSREFS
|
Cf. A065075.
Sequence in context: A052942 A117913 A064411 this_sequence A057482 A114136 A025072
Adjacent sequences: A084226 A084227 A084228 this_sequence A084230 A084231 A084232
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 21 2003
|
|
|
Search completed in 0.002 seconds
|
