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!)
A333811 a(0) = 0; for n > 0, a(n) is the smallest positive integer not yet appearing in the sequence such that a(n-1)^a(n) contains as a substring either a(n-1) or a(n). 5
0, 1, 2, 5, 3, 7, 4, 6, 8, 9, 11, 15, 12, 14, 13, 10, 16, 17, 21, 20, 25, 18, 23, 19, 22, 24, 26, 29, 30, 28, 31, 27, 32, 33, 35, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 46, 48, 50, 49, 51, 52, 53, 55, 54, 56, 57, 59, 58, 61, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(3) = 5 as a(2) ^ a(3) = 2 ^ 5 = 32 which contains '2' as a substring.

a(4) = 3 as a(3) ^ a(4) = 5 ^ 3 = 125 which contains '5' as a substring.

a(5) = 7 as a(4) ^ a(5) = 3 ^ 7 = 2187 which contains '7' as a substring.

LINKS

Table of n, a(n) for n=0..70.

Rémy Sigrist, PARI program for A333811

PROG

(PARI) See Links section.

CROSSREFS

Cf. A333774, A333775, A332795, A332703.

Sequence in context: A112486 A253924 A141410 * A257906 A257983 A210770

Adjacent sequences:  A333808 A333809 A333810 * A333812 A333813 A333814

KEYWORD

nonn,base

AUTHOR

Scott R. Shannon, Apr 05 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 August 4 16:34 EDT 2020. Contains 336202 sequences. (Running on oeis4.)