login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A265155 Integers, n, which are unique starting points for the algorithm described in A090566. 8
1, 2, 4, 8, 10, 11, 14, 15, 16, 17, 18, 19, 21, 22, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The algorithm of A090566, i.e.; a(n) is the initial term and subsequent terms are the smallest number greater that the previous term such that the concatenation of the two is a perfect square.

Complement 3, 5, 6, 7, 9, 12, 13, 20, …, .

An initial value of 3, 6, 12, 20, …,  quickly merges into A090566.

An initial value of 5, 7, 9, …, quickly merges into A265148.

An initial value of 9, …, quickly merges into A265149.

An initial value of 13, …, quickly merges into A265151.

An initial value of 15, …, quickly merges into A265152.

LINKS

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

MATHEMATICA

See the Mmca coding in A090566 or A265147-A265154.

CROSSREFS

Cf. A090566, A243091, A265147, A265148, A265149, A265150, A265151, A265152, A265153, A265154.

Sequence in context: A028836 A028838 A178332 * A070305 A174567 A178330

Adjacent sequences:  A265152 A265153 A265154 * A265156 A265157 A265158

KEYWORD

nonn,base

AUTHOR

Robert G. Wilson v, Dec 02 2015

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 17 15:28 EDT 2019. Contains 324194 sequences. (Running on oeis4.)