This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216998 Digit sum of n*7 mod 7. 5
 0, 5, 3, 3, 1, 6, 6, 4, 2, 0, 0, 5, 3, 3, 6, 4, 4, 2, 0, 5, 5, 3, 1, 1, 6, 4, 4, 2, 5, 3, 3, 1, 6, 6, 4, 2, 2, 0, 5, 3, 3, 1, 4, 4, 2, 0, 0, 5, 3, 1, 1, 6, 4, 4, 2, 0, 0, 3, 1, 6, 6, 4, 2, 2, 0, 5, 5, 3, 1, 6, 6, 2, 0, 0, 5, 3, 3, 1, 6, 4, 4, 2, 0, 0, 5, 1, 1, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Zeros correspond to A216994. LINKS EXAMPLE a(8) corresponds to the digit sum of 56, which is 11, mod 7, so a(8)=4. MATHEMATICA Table[Mod[Total[IntegerDigits[7*n]], 7], {n, 100}] (* T. D. Noe, Sep 24 2012 *) PROG (JavaScript) function sumarray(arr) { t=0; for (i=0; i

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

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)