|
|
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
|
|
|
MAPLE
|
a:= proc(n) a(n):= `if`(n=1, 1, parse(cat(n^2, a(n-1)))) end:
|
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
M. I. Petrescu (mipetrescu(AT)yahoo.com)
|
|
STATUS
|
approved
|
|
|
|