login
A108695
a(n) = number of times the digit congruent to n mod 10 has appeared in the sequence.
0
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0, 0, 0, 0, 19, 3, 0, 1, 0, 0, 0, 0, 0, 1, 25, 5, 1, 1, 0, 2, 0, 0, 0, 1, 29, 8, 3, 2, 0, 2, 0, 0, 1, 2, 32, 9, 7, 3, 0, 2, 0, 1, 1, 3, 34, 11, 8, 6, 1, 2, 1, 1, 2, 3, 34, 16, 10, 8, 2, 2, 2, 1, 3, 3, 35, 19, 13, 12, 2, 3, 2, 1, 3, 4, 35, 23, 17, 16, 3, 4, 3
OFFSET
0,11
EXAMPLE
a(21) = 3 because the digit '1' which is congruent to 21 mod 10 has appeared 3 times in the sequence prior to this term.
CROSSREFS
Sequence in context: A277926 A222521 A068159 * A265373 A309202 A105031
KEYWORD
base,nonn
AUTHOR
Andrew Weimholt, Jun 19 2005
STATUS
approved