login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046399 Smallest squarefree palindrome with exactly n distinct prime factors. 1
1, 2, 6, 66, 858, 6006, 222222, 22444422, 244868442, 6434774346, 438024420834, 50146955964105, 2415957997595142, 495677121121776594 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Initial terms of sequences A046392-A046398.

REFERENCES

J.-P. Delahaye, Merveilleux nombres premiers ("Amazing primes"), p. 315, Pour la Science, Paris 2000.

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}] - Ryan Propper (rpropper(AT)stanford.edu), Sep 16 2005

CROSSREFS

Cf. A046385.

Sequence in context: A070872 A055685 A082619 * A082617 A006517 A091458

Adjacent sequences:  A046396 A046397 A046398 * A046400 A046401 A046402

KEYWORD

nonn,hard,base

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1998.

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Dec 06 2008 at the suggestion of R. J. Mathar

a(10)-a(13) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 03 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 12:18 EST 2012. Contains 205379 sequences.