|
Search: id:A095206
|
|
|
| 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, i ranges over all the nonzero digits of n. |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
20,4
|
|
|
COMMENT
|
a(k) = 0 for k <11 and a(k) = 1 for 11 < k < 20
|
|
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: A082844 A101406 A097509 this_sequence A049071 A029211 A018837
Adjacent sequences: A095203 A095204 A095205 this_sequence A095207 A095208 A095209
|
|
KEYWORD
|
base,more,nonn,uned
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 06 2004
|
|
|
Search completed in 0.002 seconds
|
