|
Search: id:A061118
|
|
|
| A061118 |
|
Let s(n) be the sequence of squares (A000290). Then this sequence is given by s(1), s(2)s(1)s(3), s(4)s(2)s(1)s(3)s(5), ... |
|
+0
1
|
|
| 1, 419, 1641925, 36164192549, 643616419254981, 100643616419254981121, 144100643616419254981121169, 196144100643616419254981121169225, 256196144100643616419254981121169225289
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Felice Russo, A set of new Smarandache functions, sequences and conjectures in number theory.
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
FORMULA
|
a(n) is the concatenation of squares about 1 with even squares on the left and the odd squares on the right.
|
|
EXAMPLE
|
a(3) = 1641925, concatenation of 16, 4, 1, 9 and 25.
|
|
MAPLE
|
for n from 1 to 15 do for k from 2*(n-1) to 2 by -2 do printf(`%d`, k^2) od: for k from 1 to 2*n-1 by 2 do printf(`%d`, k^2) od: printf(`, `): od:
|
|
CROSSREFS
|
Sequence in context: A142733 A060230 A130737 this_sequence A097822 A069064 A024410
Adjacent sequences: A061115 A061116 A061117 this_sequence A061119 A061120 A061121
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 21 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 23 2001
|
|
|
Search completed in 0.002 seconds
|
