This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095206 Let n = abcd...; a,b,c,d,... are digits of n. Define f(a) = bcd..., f(b) = acd..., f(c) = abd... and f(d) = abc..., i.e., f(i) = number obtained by deleting the digit i from n. Then a(n) = Sum f(i) mod i, where i ranges over all the nonzero digits of n. 0
 0, 1, 0, 3, 2, 3, 2, 3, 2, 3, 0, 1, 3, 0, 4, 5, 3, 4, 5, 3, 0, 1, 2, 4, 0, 5, 6, 7, 4, 5, 0, 1, 3, 5, 5, 0, 6, 7, 8, 9, 0, 1, 2, 3, 6, 6, 0, 7, 8, 9, 0, 1, 3, 4, 7, 7, 7, 0, 8, 9, 0, 1, 2, 5, 4, 8, 8, 8, 0, 9, 0, 1, 3, 3, 5, 9, 9, 9, 9, 0, 0, 0, 0, 1, 2, 0, 4, 3, 2, 1, 0, 0, 1, 2, 3, 1, 5, 4, 3, 2, 0, 1, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 20,4 COMMENTS a(k) = 0 for k < 11 and a(k) = 1 for 11 < k < 20. LINKS EXAMPLE a(23) = 3 mod 2 + 2 mod 3 = 1 + 2 = 3. a(256) = 56 mod 2 + 26 mod 5 + 25 mod 6 =0 + 1 + 1 = 2. CROSSREFS Sequence in context: A101406 A245219 A097509 * A308006 A049071 A168330 Adjacent sequences:  A095203 A095204 A095205 * A095207 A095208 A095209 KEYWORD base,nonn,uned AUTHOR Amarnath Murthy, Jun 06 2004 EXTENSIONS More terms from Max Alekseyev, Apr 26 2010 STATUS approved

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 October 19 22:55 EDT 2019. Contains 328244 sequences. (Running on oeis4.)