|
Search: id:A078215
|
|
|
| A078215 |
|
a(1) = 1; a(n) for n > 1 is the smallest multiple of a(n-1) that is a square and begins with n. |
|
+0
4
|
|
| 1, 25, 3025, 48400, 5856400, 6377619600, 771691971600, 840372557072400, 915165714651843600, 1057931566137531201600, 1152087475523771478542400, 1254623260845387140132673600, 1366284731060626595604481550400
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
For n = 3 we have a(n-1) = a(2) = 25; 121*25 = 3025 is the smallest multiple of 25 that is a square and begins with 3, so a(3) = 3025.
|
|
PROGRAM
|
(PARI) {print1(a=1, ", "); for(n=2, 13, k=floor(log(a)/log(10))+1; s=n; t=s+1; m=floor(log(s)/log(10))+1; d=k-m; s=s*10^d; t=t*10^d; b=1; while(b>0, q=floor(s/a); while(b>0&&(p=q*a)<t, if(p>=s&&issquare(p), print1(p, ", "); b=0, q++)); s=10*s; t=10*t); a=p)}
|
|
CROSSREFS
|
Cf. A078216, A078815.
Adjacent sequences: A078212 A078213 A078214 this_sequence A078216 A078217 A078218
Sequence in context: A082488 A014797 A077519 this_sequence A075414 A013737 A018861
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 22 2002
|
|
EXTENSIONS
|
Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 06 2002
|
|
|
Search completed in 0.002 seconds
|
