_Paolo P. Lava & _ and _Giorgio Balzarotti (paoloplava(AT)gmail.com), _, Mar 23 2009

Corrected by _Floris P. van Doorn (florisvandoorn(AT)hotmail.com), _, Sep 25 2009

Paolo P. Lava & Giorgio Balzarotti (pplpaoloplava(AT)splgmail.atcom), Mar 23 2009

Floris P. van Doorn, <a href="/A158642/b158642.txt">Table of n, a(n) for n=0,...,10126</a> (every term with at most 27 digits)

easy,nonn,base,new

Floris P. van Doorn, <a href="b047999b158642.txt">Table of n, a(n) for n=0,...,10126</a> (every term with at most 27 digits)

easy,nonn,base,new

Palindromic numbers which are the product of a number n and its reversal (n written backwards)

0, 1, 4, 9, 121, 252, 484, 10201, 12321, 14641, 20502, 23632, 26962, 40804, 44944, 1002001, 1113111, 1226221, 1234321, 1357531, 2005002, 2126212, 2216122, 2249422, 2347432, 2429242, 4008004, 4229224, 100020001

0,3

Apart from 3 which produces 9 (3*3), all the other numbers n which satisfy the definition are formed by digits 0, 1 and 2 only. Subset of A002113.

Every term has an odd number of digits. - Floris van Doorn, Sep 25 2009

Floris P. van Doorn, <a href="b047999.txt">Table of n, a(n) for n=0,...,10126</a> (every term with at most 27 digits)

0*0=0; 1*1=1; 2*2=4; 3*3=9; 11*11=121; 12*21=252; 22*22=484; 101*101=10201; 102*201=20502; etc.

Cf. A002113

easy,nonn,base

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Mar 23 2009

Corrected by Floris van Doorn (florisvandoorn(AT)hotmail.com), Sep 25 2009

approved