login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,11

LINKS

Table of n, a(n) for n=0..96.

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

Adjacent sequences:  A108692 A108693 A108694 * A108696 A108697 A108698

KEYWORD

base,nonn

AUTHOR

Andrew Weimholt, Jun 19 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 08:36 EST 2021. Contains 349543 sequences. (Running on oeis4.)