|
Search: id:A082619
|
|
|
| A082619 |
|
Smallest square-free palindrome having n prime divisors. |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
a(4) = 2002 = 2*7*11*13.
|
|
MATHEMATICA
|
r[n_] := FromDigits[Reverse[IntegerDigits[n]]]; Do[k = 1; While[r[k] != k || !SquareFreeQ[k] || Length[Select[Divisors[k], PrimeQ]] != n, k++ ]; Print[k], {n, 0, 30}] (Propper)
|
|
CROSSREFS
|
Adjacent sequences: A082616 A082617 A082618 this_sequence A082620 A082621 A082622
Sequence in context: A066756 A070872 A055685 this_sequence A046399 A082617 A006517
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Apr 29 2003
|
|
EXTENSIONS
|
Corrected and extended by Ryan Propper (rpropper(AT)stanford.edu), Sep 16 2005
|
|
|
Search completed in 0.002 seconds
|
