|
|
|
|
|
|
|
|
|
#15 by Jon E. Schoenfield at Sat Dec 07 03:26:30 EST 2019
|
|
|
|
|
|
|
|
#14 by Jon E. Schoenfield at Sat Dec 07 03:26:26 EST 2019
|
|
| FORMULA
|
a(n) = floor(10^floor(1+log10log_10(n-1))/n). After 10^k terms the number of times m will have appeared will be about 10^(k+1)/(9*m*(m+1)), e.g., 1 will appear just over 55.5% of the time. - Henry Bottomley, May 11 2001
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#13 by Bruno Berselli at Mon Jun 19 04:58:15 EDT 2017
|
|
|
|
|
|
|
|
#12 by Jon E. Schoenfield at Mon Jun 19 00:20:31 EDT 2017
|
|
|
|
|
|
|
|
#11 by Jon E. Schoenfield at Mon Jun 19 00:20:05 EDT 2017
|
|
| FORMULA
|
a(n) =[) = floor(10^[^floor(1+log10(n-1)]/))/n]. ). After 10^k terms the number of times m will have appeared will be about 10^(k+1)/(9*m*(m+1)), e.g. ., 1 will appear just over 55.5% of the time. - Henry Bottomley, May 11 2001
a(n) = A000030(floor(A011557(k)/n)) for k >= A004218(n). -- _). - _Reinhard Zumkeller_, Feb 27 2011
|
|
| AUTHOR
|
Patrick De Geest, Dec 15 1999.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#10 by N. J. A. Sloane at Fri Feb 22 21:37:10 EST 2013
|
|
| FORMULA
|
a(n) = A000030(floor(A011557(k)/n)) for k >= A004218(n). -- ). -- _Reinhard Zumkeller, _, Feb 27 2011
|
|
|
|
|
Discussion
|
| Fri Feb 22
| 21:37
| OEIS Server: https://oeis.org/edit/global/1866
|
|
|
|
|
|
|
#9 by Charles R Greathouse IV at Fri Aug 24 10:48:14 EDT 2012
|
|
| AUTHOR
|
_Patrick De Geest (pdg(AT)worldofnumbers.com), _, Dec 15 1999.
|
|
|
|
|
Discussion
|
| Fri Aug 24
| 10:48
| OEIS Server: https://oeis.org/edit/global/1824
|
|
|
|
|
|
|
#8 by Russ Cox at Fri Mar 30 18:51:19 EDT 2012
|
|
| FORMULA
|
a(n) =[10^[1+log10(n-1)]/n]. After 10^k terms the number of times m will have appeared will be about 10^(k+1)/(9*m*(m+1)), e.g. 1 will appear just over 55.5% of the time. - . - _Henry Bottomley (se16(AT)btinternet.com), _, May 11 2001
|
|
|
|
|
Discussion
|
| Fri Mar 30
| 18:51
| OEIS Server: https://oeis.org/edit/global/247
|
|
|
|
|
|
|
#7 by T. D. Noe at Sat Mar 05 23:23:13 EST 2011
|
|
|
|
|
|
|
|
#6 by T. D. Noe at Sat Mar 05 23:22:52 EST 2011
|
|
| COMMENTS
|
The number of times each digit occurs for numbers < 10^k:
...\...\a(n)==1.........2.......3........4........5........6........7........8........9
10^nk\
Inf. ..... ...5/9......5/27.....5/54.....5/90.....1/27........?........?........?.........?........?........?........?
|
|
|
|
|
|
