The OEIS is supported by the many generous donors to the OEIS Foundation. Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A299866 The sum of the first n terms of the sequence is the concatenation of the first n digits of the sequence, a(1) = 3. 3
 3, 30, 297, 2972, 29727, 297268, 2972675, 29726757, 297267568, 2972675675, 29726756750, 297267567507, 2972675675068, 29726756750675, 297267567506755, 2972675675067545, 29726756750675457, 297267567506754568, 2972675675067545675, 29726756750675456754, 297267567506754567542 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The sequence starts with a(1) = 3 and is always extended with the smallest integer not yet present in the sequence and not leading to a contradiction. LINKS Jean-Marc Falcoz, Table of n, a(n) for n = 1..300 FORMULA a(n) = c(n) - c(n-1), where c(n) = concatenation of the first n digits, c(n) ~ 0.33*10^n, a(n) ~ 0.297*10^n. See A300000 for the proof. - M. F. Hasler, Feb 22 2018 EXAMPLE 3 + 30 = 33 which is the concatenation of 3 and 3. 3 + 30 + 297 = 330 which is the concatenation of 3, 3 and 0. 3 + 30 + 297 + 2972 = 3302 which is the concatenation of 3, 3, 0 and 2. From n = 3 on, a(n) can be computed directly as c(n) - c(n-1), cf. formula: a(3) = 330 - 33 = 297, a(4) = 3302 - 330 = 2972, etc. - M. F. Hasler, Feb 22 2018 PROG (PARI) a(n, show=1, a=3, c=a, d=[a])={for(n=2, n, show&&print1(a", "); a=-c+c=c*10+d; 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. A299865, ..., A299872 for variants with a(1) = 2, ..., 9. Sequence in context: A136896 A121085 A144282 * A136941 A136940 A136929 Adjacent sequences: A299863 A299864 A299865 * A299867 A299868 A299869 KEYWORD nonn,base,easy AUTHOR Eric Angelini and Jean-Marc Falcoz, Feb 21 2018 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.

Last modified December 8 16:32 EST 2023. Contains 367680 sequences. (Running on oeis4.)