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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045966 a(1)=3; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+2}^e_i. 3
3, 5, 7, 25, 11, 35, 13, 125, 49, 55, 17, 175, 19, 65, 77, 625, 23, 245, 29, 275, 91, 85, 31, 875, 121, 95, 343, 325, 37, 385, 41, 3125, 119, 115, 143, 1225, 43, 145, 133, 1375, 47, 455, 53, 425, 539, 155, 59, 4375, 169, 605, 161, 475, 61, 1715, 187, 1625, 203, 185, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

From a puzzle proposed by Marc LeBrun.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

a[1] = 3; a[n_] := With[{f = FactorInteger[n]}, Times @@ (Prime[PrimePi[f[[All, 1]]]+2]^f[[All, 2]])]; Array[a, 60] (* Jean-Fran├žois Alcover, Jun 19 2015 *)

PROG

(Haskell)

a045966 1 = 3

a045966 n = product $ zipWith (^)

            (map a101300 $ a027748_row n) (a124010_row n)

-- Reinhard Zumkeller, Jun 03 2013, Dec 23 2011

CROSSREFS

Cf. A045967, A027748, A124010, A000040.

Cf. A101300.

Sequence in context: A141802 A029846 A108313 * A146148 A098475 A131039

Adjacent sequences:  A045963 A045964 A045965 * A045967 A045968 A045969

KEYWORD

easy,nonn,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from David W. Wilson.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 16:10 EST 2017. Contains 294936 sequences.