login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299865 The sum of the first n terms of the sequence is the concatenation of the first n digits of the sequence, and a(1) = 2. 9
2, 20, 198, 1981, 19818, 198179, 1981783, 19817838, 198178379, 1981783783, 19817837830, 198178378308, 1981783783079, 19817837830783, 198178378307837, 1981783783078363, 19817837830783638, 198178378307836379, 1981783783078363783, 19817837830783637836, 198178378307836378362, 1981783783078363783612 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The sequence starts with a(1) = 2 and is always extended with the smallest integer not yet present in the sequence and not leading to a contradiction.
LINKS
FORMULA
a(n) = c(n) - c(n-1), where c(n) = concatenation of the first n digits, c(n) ~ 0.22*10^n, a(n) ~ 0.198*10^n. See A300000 for the proof. - M. F. Hasler, Feb 22 2018
EXAMPLE
2 + 20 = 22 which is the concatenation of 2 and 2.
2 + 20 + 198 = 220 which is the concatenation of 2, 2 and 0.
2 + 20 + 198 + 1981 = 2201 which is the concatenation of 2, 2, 0 and 1.
PROG
(PARI) a(n, show=1, a=2, c=a, d=[c])={for(n=2, n, show&&print1(a", "); a=-c+c=c*10+d[1]; d=concat(d[^1], if(n>2, digits(a)))); a} \\ M. F. Hasler, Feb 22 2018
CROSSREFS
A300000 is the lexicographically first sequence of this type, with a(1) = 1.
Cf. A299866, ..., A299872 for variants with a(1) = 3, ..., 9.
Sequence in context: A287999 A348886 A001078 * A001253 A303462 A085586
KEYWORD
nonn,base
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:26 EDT 2024. Contains 371905 sequences. (Running on oeis4.)