|
Search: id:A077485
|
|
|
| A077485 |
|
a(1) = 1, then smallest n-digit square which leaves a square at every step if most significant digit and least significant digit are deleted until a one-or two-digit digit square is obtained. a(2n) = 0 if no such square exists. a(2n+1) = 10^2n only if no nontrivial candidate exists. |
|
+0
3
|
|
| 1, 16, 144, 1369, 10816, 0, 1004004, 0, 100000000, 0, 10000400004, 0, 1000000000000, 0, 100000040000004, 0, 10000000000000000, 0, 1000000004000000004, 0, 100000000000000000000, 0, 10000000000400000000004
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Beginning with term a(6) the following pattern applies: a(4k)=0; a(4k+1)=10^4k=(10^2k)^2; a(4k+2)=0; a(4k+3)=(10^(2k+1)+2)^2. - Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 03 2003
|
|
EXAMPLE
|
a(3) = 144 as 144 and 4 are both squares.
a(4) = 1369 as 1369 and 36 are both squares.
|
|
CROSSREFS
|
Cf. A077486.
Sequence in context: A000762 A086952 A155663 this_sequence A131705 A076029 A052388
Adjacent sequences: A077482 A077483 A077484 this_sequence A077486 A077487 A077488
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 07 2002
|
|
EXTENSIONS
|
Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 03 2003
|
|
|
Search completed in 0.006 seconds
|
