|
| |
|
|
A131839
|
|
Additive persistence of Sierpinski numbers of first kind.
|
|
0
| |
|
|
0, 0, 2, 2, 2, 3, 2, 3, 3, 1, 2, 3, 3, 2, 2, 4, 4, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 2, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 1, 3, 3, 3, 4, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
EXAMPLE
| Sierpinski number 257 --> 2+5+7=14 --> 1+4=5 thus persistence is 2
|
|
|
MAPLE
| P:=proc(n) local i, k, w, ok, cont; for i from 1 by 1 to n do w:=0; k:=i^i+1; ok:=1; if k<10 then print(0); else cont:=1; while ok=1 do while k>0 do w:=w+(k-(trunc(k/10)*10)); k:=trunc(k/10); od; if w<10 then ok:=0; print(cont); else cont:=cont+1; k:=w; w:=1; fi; od; fi; od; end: P(120);
|
|
|
CROSSREFS
| Cf. A014566, A131836.
Sequence in context: A076221 A029235 A106696 * A143299 A076984 A079085
Adjacent sequences: A131836 A131837 A131838 * A131840 A131841 A131842
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Jul 20 2007
|
| |
|
|
