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-5 of 5 results.

A094326 a(n) = 8 written in base n.

Original entry on oeis.org

11111111, 1000, 22, 20, 13, 12, 11, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
Offset: 1

Views

Author

N. J. A. Sloane, Jun 04 2004

Keywords

Comments

The term 111....1111 should officially be called the "unary expansion", since in base 1 only the digit 0 may appear.

Links

Crossrefs

Cf. A001732, A063432, A035613, A094324, A094325, A094327, A094232, etc.

Formula

From Elmo R. Oliveira, Jun 15 2024: (Start)
G.f.: x*(11111111-11110111*x-978*x^2-2*x^3-7*x^4-x^5-x^6-x^7-2*x^8)/(1-x).
a(n) = 8 for n > 8. (End)

A094324 a(n) = 5 written in base n.

Original entry on oeis.org

11111, 101, 12, 11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
Offset: 1

Views

Author

N. J. A. Sloane, Jun 04 2004

Keywords

Comments

The term 111....1111 should officially be called the "unary expansion", since in base 1 only the digit 0 may appear.

Links

Crossrefs

Cf. A001735, A063432, A035613, A094325, A094326, A094327, A094232, etc.

Formula

From Elmo R. Oliveira, Jun 15 2024: (Start)
G.f.: x*(11111-11010*x-89*x^2-x^3-x^4-5*x^5)/(1-x).
a(n) = 5 for n > 5. (End)

A094325 a(n) = 6 written in base n.

Original entry on oeis.org

111111, 110, 20, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
Offset: 1

Views

Author

N. J. A. Sloane, Jun 04 2004

Keywords

Comments

The term 111....1111 should officially be called the "unary expansion", since in base 1 only the digit 0 may appear.

Links

Crossrefs

Cf. A001734, A063432, A035613, A094324, A094326, A094327, A094232, etc.

Formula

From Elmo R. Oliveira, Jun 15 2024: (Start)
G.f.: x*(111111-111001*x-90*x^2-8*x^3-x^4-x^5-4*x^6)/(1-x).
a(n) = 6 for n > 6. (End)

A094327 a(n) = 9 written in base n.

Original entry on oeis.org

111111111, 1001, 100, 21, 14, 13, 12, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
Offset: 1

Views

Author

N. J. A. Sloane, Jun 04 2004

Keywords

Comments

The term 111....1111 should officially be called the "unary expansion", since in base 1 only the digit 0 may appear.

Links

Crossrefs

Cf. A001731, A063432, A035613, A094324, A094325, A094326, A094232, etc.

Programs

  • Mathematica
    Join[{111111111},Table[FromDigits[IntegerDigits[9,n]],{n,2,90}]] (* Stefano Spezia, Nov 10 2023 *)

Formula

G.f.: x*(111111111 - 111110110*x - 901*x^2 - 79*x^3 - 7*x^4 - x^5 - x^6 - x^7 - x^8 - x^9)/(1 - x). - Stefano Spezia, Nov 10 2023

A094203 a(n) = 24 written in base 13-n.

Original entry on oeis.org

20, 22, 24, 26, 30, 33, 40, 44, 120, 220, 11000, 111111111111111111111111
Offset: 1

Views

Author

N. J. A. Sloane, Jun 02 2004

Keywords

Comments

The term 111....1111 should officially be called the "unary expansion", since in base 1 only the digit 0 may appear.

References

  • Marilyn vos Savant, "Ask Marilyn," in 'Parade', Sunday, Apr 26 1999.

Crossrefs

Cf. A094232, A065147, etc.
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.