|
Search: id:A101318
|
|
|
| A101318 |
|
Numbers n such that Sum_of_Digits modulo n <= 2. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 100, 101, 110, 200, 1000, 1001, 1010, 1100, 2000, 10000, 10001, 10010, 10100, 11000, 20000, 100000, 100001, 100010, 100100, 101000, 110000, 200000, 1000000, 10000000, 10000001, 10000010, 10000100, 10001000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The first 9 natural numbers, then the numbers with Sum_of_Digits <= 2. - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 07 2006
|
|
EXAMPLE
|
sum(10)=1 and 1 mod 10 <= 2
|
|
PROGRAM
|
(PERL) #!/usr/local/bin/perl -w for $i (1..1000000){ @j = split "", $i; $sum=0; for (@j){ $sum += $_; } print "$i, " if ($sum % $i <=2); } __END__
|
|
CROSSREFS
|
Adjacent sequences: A101315 A101316 A101317 this_sequence A101319 A101320 A101321
Sequence in context: A096091 A055933 A132578 this_sequence A114801 A114802 A130575
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
gamo (gamo(AT)telecable.es), Dec 23 2004
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 07 2006
|
|
|
Search completed in 0.002 seconds
|
