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!)
A349918 Irregular table read by rows; the first row contains 1; for n > 1, the n-th row contains the base-n digits of the number whose base-(n-1) expansion is the concatenation of the previous rows. 2
1, 1, 1, 0, 2, 1, 3, 1, 3, 3, 1, 3, 0, 5, 0, 0, 4, 4, 1, 0, 4, 4, 1, 2, 1, 4, 5, 6, 0, 5, 3, 6, 0, 4, 2, 2, 6, 2, 1, 1, 5, 3, 0, 3, 0, 3, 1, 3, 5, 5, 6, 0, 6, 7, 5, 2, 4, 3, 7, 6, 7, 2, 1, 7, 6, 2, 3, 5, 0, 1, 2, 4, 4, 1, 5, 6, 0, 3, 0, 5, 4, 3, 0, 3, 3, 5, 6, 6, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

This sequence generalizes A309737 beyond the decimal base.

LINKS

Table of n, a(n) for n=1..89.

Rémy Sigrist, PARI program for A349918

EXAMPLE

Table begins:

    1;

    1;

    1, 0;

    2, 1, 3;

    1, 3, 3, 1, 3, 0;

    5, 0, 0, 4, 4, 1, 0, 4, 4, 1, 2;

    1, 4, 5, 6, 0, 5, 3, 6, 0, 4, 2, 2, 6, 2, 1, 1, 5, 3, 0, 3, 0, 3;

    ...

PROG

(PARI) See Links section.

(Python)

from sympy.ntheory.digits import digits

def fromdigits(d, b):

    n = 0

    for di in d: n *= b; n += di

    return n

def auptor(rows):

    alst = [1]

    for n in range(2, rows+1):

        alst.extend(digits(fromdigits(alst, n-1), n)[1:])

    return alst

print(auptor(8)) # Michael S. Branicky, Dec 05 2021

CROSSREFS

Cf. A309737.

Sequence in context: A039776 A048864 A003139 * A244797 A308659 A145652

Adjacent sequences:  A349915 A349916 A349917 * A349919 A349920 A349921

KEYWORD

nonn,tabf,base

AUTHOR

Rémy Sigrist, Dec 05 2021

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 August 8 21:55 EDT 2022. Contains 356016 sequences. (Running on oeis4.)