Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116993
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116993 a(n) is the least number having exactly n representations as a product of two palindromes. +0
3
13, 1, 4, 44, 66, 484, 4444, 7326, 6666, 48884, 73326, 493284, 888888, 666666, 5426124, 4888884, 6672666, 7333326, 44888844 (list; graph; listen)
OFFSET

0,1

COMMENT

a(20) <= 733333326; a(34) <= 666666666666; a(39) <= 4888888888884 and a(44) <= 7333333333326. - Farideh Firoozbakht (mymontain(AT)yahoo.com), Dec 10 2006

EXAMPLE

a(0)=13 since 13 is the smallest number that cannot be represented as a product of two palindromes. a(5)=484 since 484= 1*484 = 2*242 = 4*121 = 22*22 = 11*44.

MATHEMATICA

f[n_]:=f[n]=Length[Select[Divisors[n], #<=n^(1/2)&&FromDigits[ Reverse[IntegerDigits[ # ]]]==#&&FromDigits[Reverse[IntegerDigits [n/# ]]]==n/#&]]; a[n_]:=(For[m=1, f[m] != n, m++ ]; m); Do[Print[a[n]], {n, 0, 18}] - Farideh Firoozbakht (mymontain(AT)yahoo.com), Dec 10 2006

CROSSREFS

Cf. A002113, A125832, A125833, A125834.

Adjacent sequences: A116990 A116991 A116992 this_sequence A116994 A116995 A116996

Sequence in context: A089568 A010232 A010233 this_sequence A010234 A111738 A010235

KEYWORD

base,nonn

AUTHOR

Giovanni Resta (g.resta(AT)iit.cnr.it), Apr 02 2006

EXTENSIONS

More terms from Farideh Firoozbakht (mymontain(AT)yahoo.com), Dec 10 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research