|
Search: id:A080334
|
|
|
| A080334 |
|
n^2 read backwards, for n = 51, 50, 49, ... |
|
+0
2
|
|
| 1062, 52, 1042, 4032, 9022, 6112, 5202, 6391, 9481, 4671, 1861, 61, 1251, 4441, 9631, 6921, 5221, 6511, 9801, 4201, 169, 9, 148, 487, 927, 676, 526, 675, 925, 484, 144, 4, 163, 423, 982, 652, 522, 691, 961, 441, 121, 1, 18, 46, 94, 63, 52, 61, 9, 4, 1
(list; graph; listen)
|
|
|
OFFSET
|
51,1
|
|
|
COMMENT
|
This sequence breaks all the rules of the database, especially since the terms are in reverse order. It is included only because segments of it are sometimes given as puzzles.
|
|
FORMULA
|
Write the squares backwards: 1, 4, 9, 61, 52, 63, 94, 46, 18, 1, 121, 441, 961, 691, ..., then reverse the sequence.
|
|
CROSSREFS
|
Cf. A002942 (which is the usual version of this sequence), A000290.
Sequence in context: A020374 A142822 A122712 this_sequence A123211 A023078 A056102
Adjacent sequences: A080331 A080332 A080333 this_sequence A080335 A080336 A080337
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 19 2003
|
|
|
Search completed in 0.002 seconds
|
