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

A358257 The least significant digit of k such that 2^k, 5^k, 8^k start with the same digit.

Original entry on oeis.org

0, 5, 5, 8, 8, 8, 1, 1, 1, 4, 4, 4, 7, 7, 7, 0, 0, 0, 3, 3, 3, 6, 6, 6, 9, 9, 2, 2, 2, 5, 5, 5, 8, 8, 8, 1, 1, 1, 4, 4, 4, 7, 7, 7, 0, 0, 0, 3, 3, 3, 6, 6, 6, 9, 9, 9, 2, 2, 2, 5, 5, 5, 8, 8, 8, 1, 1, 1, 4, 4, 4, 7, 7, 7, 0, 0, 0, 3, 3, 3, 6, 6, 6, 9, 9, 9, 2, 2, 2, 5, 5, 8, 8, 8, 1, 1, 1, 4, 4, 4, 7, 7, 7, 0, 0
Offset: 1

Views

Author

Alexander M. Domashenko, Nov 05 2022

Keywords

Comments

The sequence consists of groups of identical digits. The numbers representing each group, starting from the second group, form a cycle (5, 8, 1, 4, 7, 0, 3, 6, 9, 2).

Examples

			a(3) = A358197(3) mod 10 = 15 mod 10 = 5,
a(4) = A358197(4) mod 10 = 98 mod 10 = 8,
a(9) = A358197(9) mod 10 = 221 mod 10 = 1.

Crossrefs

Cf. A010879, A358197.

Formula

a(n) = A358197(n) mod 10.
a(n) = A010879(A358197(n)).
Showing 1-1 of 1 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.