cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A229527 Start with 1, skip (sum of digits of n) numbers, accept next number.

Original entry on oeis.org

1, 3, 7, 15, 22, 27, 37, 48, 61, 69, 85, 99, 118, 129, 142, 150, 157, 171, 181, 192, 205, 213, 220, 225, 235, 246, 259, 276, 292, 306, 316, 327, 340, 348, 364, 378, 397, 417, 430, 438, 454, 468, 487, 507, 520, 528, 544, 558, 577, 597
Offset: 1

Views

Author

Dave Durgin, Sep 25 2013

Keywords

Examples

			a(1)=1, a(2)=1+1+1=3, a(3)=3+3+1=7, a(4)=7+7+1=15, a(5)=15+1+5+1=22, a(6)=22+2+2+1=27, ...
		

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = a[n - 1] + 1 + Plus @@ IntegerDigits@a[n - 1]; a[1] = 1; Array[a, 50] (* Robert G. Wilson v, Aug 01 2018 *)
  • Python
    from itertools import islice
    def A229527_gen(): # generator of terms
        a = 1
        while True:
            yield a
            a += sum(map(int,str(a)))+1
    A229527_list = list(islice(A229527_gen(),40)) # Chai Wah Wu, Aug 09 2025

Formula

a(n+1) = a(n) + (sum of digits of a(n)) + 1.