id:A108695 - OEIS Search Results

Search: id:A108695

Displaying 1-1 of 1 results found.

page 1

a(n) = number of times the digit congruent to n mod 10 has appeared in the sequence.

+0
1

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; listen)

	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: A092804 A104013 A068159 this_sequence A105031 A118762 A010178` `Adjacent sequences: A108692 A108693 A108694 this_sequence A108696 A108697 A108698`
	KEYWORD	`base,nonn`
	AUTHOR	`Andrew Weimholt (andrew(AT)weimholt.com), Jun 19 2005`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research