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.

A338255 a(n) = smallest m such that A328330(m) = n, or -1 if n never appears in A328330.

Original entry on oeis.org

4, 2, 1, 8, 10, 22, 1088
Offset: 1

Views

Author

Jens Placke, Oct 18 2020

Keywords

Comments

a(8) = 2008...888 (156 digits).

Examples

			4 is represented with 4 segments, so a(1) = 4.
2 is represented by 5 segments, 5 is represented by 5 segments so a(2) = 2.
1 is represented by 2 segments, 2 is by 5, 5 by 5 again, so a(3) = 1.
[...]
1088 is the solution for 7 steps.
2008..888 (156 digits) is the solution for 8 steps.
		

Crossrefs

Cf. A006942.
Location of first occurrence of n in A328330.