login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338255 a(n) = smallest m such that A328330(m) = n, or -1 if n never appears in A328330. 1
4, 2, 1, 8, 10, 22, 1088 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(8) <= 8*(10^156-1)/9 - 10^155 = 788...888 (156 digits).

LINKS

Table of n, a(n) for n=1..7.

Index entries for sequences related to calculator display

EXAMPLE

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.

CROSSREFS

Cf. A006942.

Location of first occurrence of n in A328330.

Sequence in context: A135294 A175938 A117016 * A013659 A016505 A304254

Adjacent sequences:  A338252 A338253 A338254 * A338256 A338257 A338258

KEYWORD

base,nonn,more

AUTHOR

Jens Placke, Oct 18 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 22 19:48 EDT 2021. Contains 345388 sequences. (Running on oeis4.)