Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136711
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136711 At step n the sequence lists the number of occurences of digit (n mod k), with k>0, in all the numbers from 1 to n. Case k=7. +0
9
1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 8, 2, 2, 2, 2, 2, 2, 13, 7, 3, 3, 3, 3, 2, 13, 13, 5, 3, 3, 3, 3, 14, 14, 13, 4, 4, 4, 4, 15, 15, 15, 12, 5, 5, 4, 15, 15, 15, 15, 10, 5, 5, 16, 16, 16, 16, 16, 9, 6, 17, 17, 17, 17, 17, 17, 7, 18, 18, 18, 18, 18, 18, 7, 18, 18, 18, 18, 18, 18, 8, 19, 19 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research