|
Search: id:A075517
|
|
|
| A075517 |
|
Created by removing all integers with a digit sum of n. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 28, 29, 37, 38, 39, 46, 47, 48, 49, 55, 56, 57, 58, 59, 64, 65, 66, 67, 68, 69, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 109, 118, 119, 127, 128, 129, 136, 137, 138, 139, 145, 146, 147
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
c=0; while (digit sum(n)>9) n=digit sum(n); c++; if (c%2) == 0, then n is in S, otherwise not.
|
|
EXAMPLE
|
18 -> 1+8 = 9. This takes 1 step to be reduced to a single integer, hence is nopt in the sequence. 99 -> 9+9 = 18, takes 2 steps and is in the sequence.
|
|
PROGRAM
|
(PARI) sumdigits(n)=local(c); c=0; while (n>0, c=c+n%10; n=n-n%10; n=n/10); c checkSieve(n)=local(c); c=0; while(n>9, n=sumdigits(n); c++); 1-c%2 for (n=1, 2000, if (checkSieve(n), print1(n, ", ")))
|
|
CROSSREFS
|
Sequence in context: A087052 A117241 A077557 this_sequence A088473 A051885 A048410
Adjacent sequences: A075514 A075515 A075516 this_sequence A075518 A075519 A075520
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Oct 11 2002
|
|
|
Search completed in 0.002 seconds
|
