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.

Showing 1-4 of 4 results.

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

Views

Author

Reinhard Zumkeller, Sep 01 2015

Keywords

Comments

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

Crossrefs

Programs

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

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

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Sep 01 2015

Keywords

Crossrefs

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

Programs

  • Haskell
    a261786 n = a261786_list !! (n-1)
    a261786_list = iterate (\x -> x + a261787 x) 1
    
  • PARI
    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

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

Original entry on oeis.org

1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1
Offset: 0

Views

Author

Reinhard Zumkeller, Sep 01 2015

Keywords

Comments

A261795(n) = a(A261793(n)).

Crossrefs

Programs

  • Haskell
    import Data.List (isInfixOf)
    a261794 x = f $ tail a031298_tabf where
       f (cs:css) = if isInfixOf cs (a031298_row x)
                       then f css else foldr (\d v -> 10 * v + d) 0 cs

Extensions

Name corrected by Álvar Ibeas, Sep 08 2020

A262288 a(0)=0; thereafter add the smallest positive number that is not a substring.

Original entry on oeis.org

0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 17, 19, 21, 24, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 80, 81, 83, 84, 85, 86, 87, 88, 89, 90, 91, 93, 94, 95, 96, 97, 98, 99, 100, 102, 105, 107
Offset: 0

Views

Author

N. J. A. Sloane, Sep 19 2015

Keywords

Examples

			In a(13) = 19 we can see a 1 but no 2, so a(14) = 19+2 = 21. Now we can see a 1 and a 2 but no 3, so a(15) = 21+3 = 24.
		

Crossrefs

Decimal analog of A260273.
Cf. A261793.

Programs

  • Mathematica
    r[n_]:=Rest[Subsets[IntegerDigits[n]]];
    s[n_]:=Union[FromDigits/@r[n]];firstN[0]=1;firstN[1]=2;
    firstN[n_]:=Min[Select[Range[Last[s[n]]],FreeQ[s[n],#]&]];
    nextTerm[n_]:=n+firstN[n];FoldList[nextTerm[#]&,0,Range@87] (* Ivan N. Ianakiev, Sep 20 2015 *)

Formula

a(n) = A261793(n) for n >= 1. - Georg Fischer, Oct 30 2018

Extensions

Typo in a(61) corrected by Ivan N. Ianakiev, Sep 20 2015
Showing 1-4 of 4 results.