login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060476 Let n = 2^e_2 * 3^e_3 * 5^e_5 * ... be the prime factorization of n; sequence gives n such that 1 + max{e_2, e_3, ...} is nonprime. 6
1, 8, 24, 27, 32, 40, 54, 56, 72, 88, 96, 104, 108, 120, 125, 128, 135, 136, 152, 160, 168, 184, 189, 200, 216, 224, 232, 243, 248, 250, 256, 264, 270, 280, 288, 296, 297, 312, 328, 343, 344, 351, 352, 360, 375, 376, 378, 384, 392, 408, 416, 424, 440, 456, 459, 472, 480 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The old entry with this sequence number was a duplicate of A005171.

a(A055229(n)) > 1 for n > 1. - Reinhard Zumkeller, Nov 30 2015

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

FORMULA

A010051(A051903(a(n)+1)) = 1. - Reinhard Zumkeller, Nov 30 2015

MATHEMATICA

Join[{1}, Select[Range[500], !PrimeQ[1+Max[FactorInteger[#][[All, 2]]]]&]] (* Jean-Fran├žois Alcover, Aug 02 2018 *)

PROG

(PARI) isA060476(n) = if(n<2, 1, !isprime(vecmax(factor(n)[, 2])+1))

(Haskell)

a060476 n = a060476_list !! (n-1)

a060476_list = filter ((== 0) . a010051' . (+ 1) . a051903) [1..]

-- Reinhard Zumkeller, Nov 30 2015

CROSSREFS

Cf. A096432, A074661.

Cf. A010051, A051903.

Sequence in context: A029607 A244030 A325990 * A295661 A240111 A301517

Adjacent sequences:  A060473 A060474 A060475 * A060477 A060478 A060479

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Sep 18 2008

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 16:42 EST 2020. Contains 331245 sequences. (Running on oeis4.)