|
| |
|
|
A038397
|
|
Concatenate first n squares in reverse order.
|
|
14
|
|
|
|
1, 41, 941, 16941, 2516941, 362516941, 49362516941, 6449362516941, 816449362516941, 100816449362516941, 121100816449362516941, 144121100816449362516941, 169144121100816449362516941, 196169144121100816449362516941, 225196169144121100816449362516941
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Mihaly Bencze [Beneze], L. Tutescu, Some Notions and Questions in Number Theory, Sequence 5.
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 1..225
|
|
|
FORMULA
|
a(n) = (n^2)*10^floor(1 + log_10(a(n-1))) + a(n-1), with a(1) = 1. - Paolo P. Lava, Jun 20 2008
|
|
|
MAPLE
|
P:=proc(i) local a, n; a:=1; print(1); for n from 2 by 1 to i do a:=n^2*10^floor(evalf(1+log10(a), 1000))+a; print(a); od; end: P(100); # Paolo P. Lava, Jun 20 2008
# second Maple program:
a:= proc(n) a(n):= `if`(n=1, 1, parse(cat(n^2, a(n-1)))) end:
seq(a(n), n=1..20); # Alois P. Heinz, Jan 13 2021
|
|
|
MATHEMATICA
|
Join[{s = 1}, Table[s = FromDigits[Flatten[IntegerDigits[{n^2, s}]]], {n, 2, 12}]] (* Jayanta Basu, Jul 14 2013 *)
|
|
|
PROG
|
(Haskell)
a038397 n = a038397_list !! (n-1)
a038397_list = f "" $ tail a000290_list where
f xs (q:qs) = (read ys :: Integer) : f ys qs
where ys = show q ++ xs
-- Reinhard Zumkeller, Mar 01 2014
|
|
|
CROSSREFS
|
Cf. A000290, A019521.
Sequence in context: A300173 A293619 A177418 * A104349 A091314 A059762
Adjacent sequences: A038394 A038395 A038396 * A038398 A038399 A038400
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
M. I. Petrescu (mipetrescu(AT)yahoo.com)
|
|
|
STATUS
|
approved
|
| |
|
|
