A261789 -id:A261789 - cp's OEIS frontend

A261786 Successively add the smallest ternary number that is not a substring.

1, 3, 5, 8, 9, 11, 15, 18, 19, 22, 25, 28, 30, 32, 36, 38, 43, 46, 49, 52, 55, 58, 61, 64, 68, 71, 74, 75, 79, 82, 84, 86, 90, 92, 96, 100, 104, 108, 110, 115, 120, 122, 125, 128, 131, 134, 137, 140, 143, 146, 150, 153, 156, 160, 163, 166, 169, 172, 176, 179

Offset: 1

Reinhard Zumkeller, Sep 01 2015

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A007089, A261787, A261789 (first differences), A261788, A260273, A261793.

a261786 n = a261786_list !! (n-1)
a261786_list = iterate (\x -> x + a261787 x) 1

ts(n) = Str(fromdigits(digits(n, 3))); \\ A007089
f(n) = my(s=ts(n), k=1); while (#strsplit(s, ts(k)) != 1, k++); k; \\ A261787
lista(nn) = my(v = vector(nn)); v[1] = 1; for (n=2, nn, v[n] = v[n-1] + f(v[n-1]);); v; \\ Michel Marcus, Feb 06 2022

A261787 a(n) is the smallest nonzero number that is not a substring of n in ternary representation.

Original entry on oeis.org

1, 2, 1, 2, 2, 3, 1, 3, 1, 2, 2, 4, 2, 2, 3, 3, 3, 3, 1, 3, 1, 4, 3, 3, 1, 3, 1, 2, 2, 4, 2, 2, 4, 4, 4, 4, 2, 2, 5, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 1, 3, 1, 4, 3, 3, 1, 3, 1, 4, 4, 4, 5, 3, 3, 3, 3, 3, 1, 3, 1, 4, 3, 3, 1, 3, 1, 2, 2, 4, 2, 2

Offset: 0

Reinhard Zumkeller, Sep 01 2015

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Cf. A007089, A030341, A261789, A261786, A261461, A261794.

import Data.List (isInfixOf)
a261787 x = f $ tail a030341_tabf where
   f (cs:css) = if isInfixOf cs (a030341_row x)
                   then f css else foldr (\d v -> 3 * v + d) 0 cs

ts(n) = Str(fromdigits(digits(n, 3)));
a(n) = my(s=ts(n), k=1); while (#strsplit(s, ts(k)) != 1, k++); k; \\ Michel Marcus, Feb 05 2022

A261789(n) = a(A261786(n)).

A261795 First differences of A261793.

Original entry on oeis.org

2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2

Offset: 1

Reinhard Zumkeller, Sep 01 2015

nonn

a(n) = A261794(A261793(n)).

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A261794, A261793, A261018, A261789.

a261795 n = a261795_list !! (n-1)
a261795_list = zipWith (-) (tail a261793_list') a261793_list'

cp's OEIS Frontend

A261786 Successively add the smallest ternary number that is not a substring.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

PARI

A261787 a(n) is the smallest nonzero number that is not a substring of n in ternary representation.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

PARI

Formula

A261795 First differences of A261793.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell