A031035 -id:A031035 - cp's OEIS frontend

A031036 Position of n-th 0 in A031035.

9, 25, 41, 57, 73, 89, 105, 121, 122, 124, 127, 130, 133, 136, 139, 142, 146, 170, 194, 218, 242, 266, 290, 313, 314, 316, 319, 322, 325, 328, 331, 334, 338, 362, 386, 410, 434, 458, 482, 505, 506, 508, 511, 514, 517, 520, 523, 526, 530, 554, 578, 602, 626, 650

Offset: 1

Clark Kimberling

nonn

Robert Israel, Table of n, a(n) for n = 1..10000

A:= [seq](op(ListTools:-Reverse(convert(n,base,8))),n=1..400):
select(t -> A[t]=0, [$1..nops(A)]); # Robert Israel, Nov 12 2024

PositionIndex[Flatten[IntegerDigits[Range[500], 8]]][0] (* Paolo Xausa, Nov 14 2024 *)

A031041 Position of n-th 5 in A031035.

Original entry on oeis.org

5, 19, 35, 51, 67, 72, 74, 76, 78, 80, 82, 83, 84, 86, 99, 115, 137, 161, 185, 209, 233, 241, 244, 247, 250, 253, 256, 257, 259, 262, 281, 305, 329, 353, 377, 401, 425, 433, 436, 439, 442, 445, 448, 449, 451, 454, 473, 497, 521

Offset: 1

Clark Kimberling

nonn

A031037 Position of n-th 1 in A031035.

Original entry on oeis.org

1, 8, 10, 11, 12, 14, 16, 18, 20, 22, 27, 43, 59, 75, 91, 107, 120, 123, 125, 126, 129, 132, 135, 138, 141, 144, 145, 147, 148, 149, 150, 151, 153, 154, 156, 157, 159, 160, 162, 163, 165, 166, 168, 171, 173, 174, 177, 180, 183, 186

Offset: 1

Clark Kimberling

nonn

A031038 Position of n-th 2 in A031035.

Original entry on oeis.org

2, 13, 24, 26, 28, 29, 30, 32, 34, 36, 38, 45, 61, 77, 93, 109, 128, 152, 169, 172, 175, 176, 178, 181, 184, 187, 190, 200, 224, 248, 272, 296, 312, 315, 318, 320, 321, 324, 327, 330, 333, 336, 339, 342, 344, 345, 348, 351, 354

Offset: 1

Clark Kimberling

nonn

A031039 Position of n-th 3 in A031035.

Original entry on oeis.org

3, 15, 31, 40, 42, 44, 46, 47, 48, 50, 52, 54, 63, 79, 95, 111, 131, 155, 179, 193, 196, 199, 202, 203, 205, 208, 211, 214, 227, 251, 275, 299, 323, 347, 371, 385, 388, 391, 394, 395, 397, 400, 403, 406, 419, 443, 467, 491, 504

Offset: 1

Clark Kimberling

nonn

A031040 Position of n-th 4 in A031035.

Original entry on oeis.org

4, 17, 33, 49, 56, 58, 60, 62, 64, 65, 66, 68, 70, 81, 97, 113, 134, 158, 182, 206, 217, 220, 223, 226, 229, 230, 232, 235, 238, 254, 278, 302, 326, 350, 374, 398, 409, 412, 415, 418, 421, 422, 424, 427, 430, 446, 470, 494, 518

Offset: 1

Clark Kimberling

nonn

A031042 Position of n-th 6 in A031035.

Original entry on oeis.org

6, 21, 37, 53, 69, 85, 88, 90, 92, 94, 96, 98, 100, 101, 102, 117, 140, 164, 188, 212, 236, 260, 265, 268, 271, 274, 277, 280, 283, 284, 286, 308, 332, 356, 380, 404, 428, 452, 457, 460, 463, 466, 469, 472, 475, 476, 478, 500, 524

Offset: 1

Clark Kimberling

nonn

A031043 Position of n-th 7 in A031035.

Original entry on oeis.org

7, 23, 39, 55, 71, 87, 103, 104, 106, 108, 110, 112, 114, 116, 118, 119, 143, 167, 191, 215, 239, 263, 287, 289, 292, 295, 298, 301, 304, 307, 310, 311, 335, 359, 383, 407, 431, 455, 479, 481, 484, 487, 490, 493, 496, 499, 502

Offset: 1

Clark Kimberling

nonn

A031044 a(n)=least k such that base 8 representation of n begins at s(k), where s=A031035.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 1, 14, 16, 18, 20, 22, 24, 13, 28, 2, 32, 34, 36, 38, 40, 15, 31, 46, 3, 50, 52, 54, 56, 17, 33, 49, 64, 4, 68, 70, 72, 19, 35, 51, 67, 82, 5, 86, 88, 21, 37, 53, 69, 85, 100, 6, 104, 7, 23, 39, 55, 71, 87, 103, 120, 8

Offset: 1

Clark Kimberling

nonn

A033307 Decimal expansion of Champernowne constant (or Mahler's number), formed by concatenating the positive integers.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 0, 1, 1, 1, 2, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 2, 0, 2, 1, 2, 2, 2, 3, 2, 4, 2, 5, 2, 6, 2, 7, 2, 8, 2, 9, 3, 0, 3, 1, 3, 2, 3, 3, 3, 4, 3, 5, 3, 6, 3, 7, 3, 8, 3, 9, 4, 0, 4, 1, 4, 2, 4, 3, 4, 4, 4, 5, 4, 6, 4, 7, 4, 8, 4, 9, 5, 0, 5, 1, 5, 2, 5, 3, 5, 4, 5, 5, 5, 6, 5

Offset: 0

Eric W. Weisstein

This number is known to be normal in base 10.

Named after David Gawen Champernowne (July 9, 1912 - August 19, 2000). - Robert G. Wilson v, Jun 29 2014

			0.12345678910111213141516171819202122232425262728293031323334353637383940414243...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 6.9, p. 442.
G. Harman, One hundred years of normal numbers, in M. A. Bennett et al., eds., Number Theory for the Millennium, II (Urbana, IL, 2000), 149-166, A K Peters, Natick, MA, 2002.
C. A. Pickover, The Math Book, Sterling, NY, 2009; see p. 364.
H. M. Stark, An Introduction to Number Theory. Markham, Chicago, 1970, p. 172.

Harry J. Smith, Table of n, a(n) for n = 0..20000
D. H. Bailey and R. E. Crandall, Random Generators and Normal Numbers, Exper. Math. 11, 527-546, 2002.
Maya Bar-Hillel and Willem A. Wagenaar, The perception of randomness, Advances in applied mathematics 12.4 (1991): 428-454. See page 428.
Edward B. Burger, Diophantine Olympics and World Champions: Polynomials and Primes Down Under, Amer. Math. Monthly, 107 (Nov. 2000), 822-829.
Chess Programming Wiki, David Champernowne (as of Dec. 2019).
D. G. Champernowne, The Construction of Decimals Normal in the Scale of Ten, J. London Math. Soc., 8 (1933), 254-260.
Arthur H. Copeland and Paul Erdős, Note on Normal Numbers, Bull. Amer. Math. Soc. 52, 857-860, 1946.
Peyman Nasehpour, A Simple Criterion for Irrationality of Some Real Numbers, arXiv:1806.07560 [math.AC], 2018.
Simon Plouffe, Champernowne constant, the natural integers concatenated.
Simon Plouffe, Champernowne constant, the natural integers concatenated.
Simon Plouffe, Generalized expansion of real constants.
Paul Pollack and Joseph Vandehey, Besicovitch, Bisection, and the normality of 0.(1)(4)(9)(16)(25)..., arXiv:1405.6266 [math.NT], 2014.
Paul Pollack and Joseph Vandehey, Besicovitch, Bisection, and the Normality of 0.(1)(4)(9)(16)(25)..., The American Mathematical Monthly 122.8 (2015): 757-765.
John K. Sikora, On the High Water Mark Convergents of Champernowne's Constant in Base Ten, arXiv:1210.1263 [math.NT], 2012.
John K. Sikora, Analysis of the High Water Mark Convergents of Champernowne's Constant in Various Bases, arXiv:1408.0261 [math.NT], 2014.
Eric Weisstein's World of Mathematics, Champernowne constant.
Wikipedia, Champernowne constant.
Hector Zenil, N. Kiani and J. Tegner, Low Algorithmic Complexity Entropy-deceiving Graphs, arXiv preprint arXiv:1608.05972 [cs.IT], 2016.
Index entries for transcendental numbers

See A030167 for the continued fraction expansion of this number.
A007376 is the same sequence but with a different interpretation.
Cf. A007908, A000027, A001191 (concatenate squares).
Tables in which the n-th row lists the base b digits of n: A030190 and A030302 (b = 2), A003137 and A054635 (b = 3), A030373 (b = 4), A031219 (b = 5), A030548 (b = 6), A030998 (b = 7), A031035 and A054634 (b = 8), A031076 (b = 9), A007376 and this sequence (b = 10). - Jason Kimberley, Dec 06 2012
Cf. A065648.
Cf. A365237 (reciprocal).

a033307 n = a033307_list !! n
a033307_list = concatMap (map (read . return) . show) [1..] :: [Int]
-- Reinhard Zumkeller, Aug 27 2013, Mar 28 2011

&cat[Reverse(IntegerToSequence(n)):n in[1..50]]; // Jason Kimberley, Dec 07 2012

Flatten[IntegerDigits/@Range[0, 57]] (* Or *)
almostNatural[n_, b_] := Block[{m = 0, d = n, i = 1, l, p}, While[m <= d, l = m; m = (b - 1) i*b^(i - 1) + l; i++]; i--; p = Mod[d - l, i]; q = Floor[(d - l)/i] + b^(i - 1); If[p != 0, IntegerDigits[q, b][[p]], Mod[q - 1, b]]]; Array[ almostNatural[#, 10] &, 105] (* Robert G. Wilson v, Jul 23 2012 and modified Jul 04 2014 *)
intermediate[n_] := Ceiling[FullSimplify[ProductLog[Log[10]/10^(1/9) (n - 1/9)] / Log[10] + 1/9]]; champerDigit[n_] := Mod[Floor[10^(Mod[n + (10^intermediate[n] - 10)/9, intermediate[n]] - intermediate[n] + 1) Ceiling[(9n + 10^intermediate[n] - 1)/(9intermediate[n]) - 1]], 10]; (* David W. Cantrell, Feb 18 2007 *)
First[RealDigits[ChampernowneNumber[], 10, 100]] (* Paolo Xausa, May 02 2024 *)

{ default(realprecision, 20080); x=0; y=1; d=10.0; e=1.0; n=0; while (y!=x, y=x; n++; if (n==d, d=d*10); e=e*d; x=x+n/e; ); d=0; for (n=0, 20000, x=(x-d)*10; d=floor(x); write("b033307.txt", n, " ", d)); } \\ Harry J. Smith, Apr 20 2009

from itertools import count
def agen():
    for k in count(1): yield from list(map(int, str(k)))
a = agen()
print([next(a) for i in range(104)]) # Michael S. Branicky, Sep 13 2021

val numerStr = (1 to 100).map(Integer.toString()).toList.reduce( + _)
numerStr.split("").map(Integer.parseInt()).toList // _Alonso del Arte, Nov 04 2019

Let "index" i = ceiling( W(log(10)/10^(1/9) (n - 1/9))/log(10) + 1/9 ) where W denotes the principal branch of the Lambert W function. Then a(n) = (10^((n + (10^i - 10)/9) mod i - i + 1) * ceiling((9n + 10^i - 1)/(9i) - 1)) mod 10. See also Mathematica code. - David W. Cantrell, Feb 18 2007

cp's OEIS Frontend

A031036 Position of n-th 0 in A031035.

Views

Author

Keywords

Links

Programs

Maple

Mathematica

A031041 Position of n-th 5 in A031035.

Views

Author

Keywords

A031037 Position of n-th 1 in A031035.

Views

Author

Keywords

A031038 Position of n-th 2 in A031035.

Views

Author

Keywords

A031039 Position of n-th 3 in A031035.

Views

Author

Keywords

A031040 Position of n-th 4 in A031035.

Views

Author

Keywords

A031042 Position of n-th 6 in A031035.

Views

Author

Keywords

A031043 Position of n-th 7 in A031035.

Views

Author

Keywords

A031044 a(n)=least k such that base 8 representation of n begins at s(k), where s=A031035.

Views

Author

Keywords

A033307 Decimal expansion of Champernowne constant (or Mahler's number), formed by concatenating the positive integers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Python

Scala

Formula