login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101318 Numbers n such that Sum_of_Digits modulo n <= 2. 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, 1000001, 1000010, 1000100, 1001000, 1010000, 1100000, 2000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The first 9 natural numbers, then the numbers with Sum_of_Digits <= 2. - Stefan Steinerberger, Feb 07 2006

LINKS

Table of n, a(n) for n=1..42.

EXAMPLE

sum(10)=1 and 1 mod 10 <= 2

MATHEMATICA

Select[Range[10001000], Mod[Total[IntegerDigits[#]], #]<3&] (* Harvey P. Dale, May 06 2018 *)

PROG

(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

Sequence in context: A055933 A188650 A132578 * A337925 A130575 A330760

Adjacent sequences: A101315 A101316 A101317 * A101319 A101320 A101321

KEYWORD

nonn

AUTHOR

gamo (gamo(AT)telecable.es), Dec 23 2004

EXTENSIONS

More terms from Stefan Steinerberger, Feb 07 2006

Corrected by Harvey P. Dale, May 06 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 12:26 EST 2022. Contains 358634 sequences. (Running on oeis4.)