|
Search: id:A084228
|
|
|
| A084228 |
|
a(1)=1, a(2)=2, a(n) = sum of digits of a(1)+a(2)+a(3)+...+a(n-1). |
|
+0
1
|
|
| 1, 2, 3, 6, 3, 6, 3, 6, 3, 6, 12, 6, 12, 15, 12, 15, 3, 6, 3, 6, 12, 6, 12, 15, 12, 15, 3, 6, 3, 6, 12, 6, 12, 15, 12, 15, 12, 6, 12, 6, 12, 15, 12, 15, 12, 15, 12, 6, 12, 15, 12, 15, 12, 15, 12, 15, 12, 15, 12, 15, 21, 15, 12, 15, 12, 15, 21, 24, 12, 15, 12, 15, 21, 24, 12, 15, 21, 15
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n)==0 (mod 3) n>2. a(n)=3 for n=3,5,7,9,17,19,27,29,87,95,97,159...
|
|
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, 300, an[n]=sumdig(sum(k=1, n-1, a(k)))) //
|
|
CROSSREFS
|
Cf. A065075.
Adjacent sequences: A084225 A084226 A084227 this_sequence A084229 A084230 A084231
Sequence in context: A073546 A115033 A093396 this_sequence A129915 A019773 A109536
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 21 2003
|
|
|
Search completed in 0.002 seconds
|
