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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076886 Smallest palindrome with exactly n prime factors (counted with multiplicity). 0
1, 2, 4, 8, 88, 252, 2772, 27872, 2112, 4224, 8448, 44544, 48384, 2977792, 27011072, 405504, 4091904, 441606144, 405909504, 886898688, 677707776, 4285005824, 276486684672, 21128282112, 633498894336, 2701312131072, 8691508051968 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

EXAMPLE

a(4)=88 because 88 is the smallest palindromic number with 4 prime factors, 2^3*11 (counted with multiplicity).

MATHEMATICA

f[n_] := Length[ Flatten[ Table[ # [[1]], { # [[2]]}] & /@ FactorInteger[n]]]; a = Table[0, {50}]; Do[b = IntegerDigits[n]; c = FromDigits[ Join[b, Drop[ Reverse[b], 1]]]; d = FromDigits[ Join[ b, Reverse[b]]]; e = f[c]; If[ a[[e + 1]] == 0 || a[[e + 1]] > c, a[[e + 1]] = c]; e = f[d]; If[ a[[e + 1]] == 0 || a[[e + 1]] > d, a[[e + 1]] = d], {n, 1, 18697304}]

CROSSREFS

Sequence in context: A018580 A089337 A088114 * A046385 A068664 A199166

Adjacent sequences:  A076883 A076884 A076885 * A076887 A076888 A076889

KEYWORD

base,nonn

AUTHOR

Shyam Sunder Gupta (guptass(AT)rediffmail.com), Nov 25 2002

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 02 2002

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.