Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068617
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068617 Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing square sequence for the seed a(1) = 8. +0
1
8, 81, 841, 38416 (list; graph; listen)
OFFSET

1,1

COMMENT

The growing square sequence for 1 and 6, 2 and 5 and 4 and 9 in pairs are the same.

EXAMPLE

a(2)=81 hence a(3) = 841 the smallest square formed from 81.

CROSSREFS

Cf. A068175, A068176, A068177, A068178, A068616.

Sequence in context: A007792 A098308 A055996 this_sequence A007778 A065440 A092366

Adjacent sequences: A068614 A068615 A068616 this_sequence A068618 A068619 A068620

KEYWORD

base,hard,more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 25 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research