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

A018867 Smallest power of 8 that begins with n.

Original entry on oeis.org

1, 262144, 32768, 4096, 512, 64, 73786976294838206464, 8, 9223372036854775808, 1073741824, 1152921504606846976, 1237940039285380274899124224, 134217728, 144115188075855872, 154742504910672534362390528, 16777216
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A018802 (k=2), A018857 (k=3), A018859 (k=4), A018861 (k=5), A018863 (k=6), A018865 (k=7), this sequence (k=8), A018869 (k=9).

Formula

a(n) = 8^A018868(n). - Seiichi Manyama, Jan 29 2017
a(8^n) = 8^n for n >= 0. - Seiichi Manyama, Jan 29 2017

A018862 5^a(n) is smallest power of 5 beginning with n.

Original entry on oeis.org

0, 2, 5, 11, 1, 4, 7, 50, 10, 63, 23, 3, 56, 26, 6, 69, 49, 29, 9, 82, 62, 42, 22, 12, 2, 75, 55, 45, 25, 15, 5, 88, 68, 58, 48, 38, 28, 18, 8, 91, 81, 71, 61, 51, 41, 31, 21, 11, 104, 94, 84, 74, 167, 64, 54, 44, 137, 34, 24, 117, 14, 4, 97, 87, 180, 77, 67, 160, 57, 150, 47, 37, 130
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    a(n) = my(k=0, ss=Str(n)); while(strsplit(Str(5^k), ss)[1] != "", k++); k; \\ Michel Marcus, Aug 19 2025
Showing 1-2 of 2 results.