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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058035 Largest 4th-power-free number dividing n. 3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 8, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 8, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 24, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 8, 65, 66, 67, 68, 69, 70, 71, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

H. Bottomley, Some Smarandache-type multiplicative sequences

FORMULA

Multiplicative with a(p^e) = p ^ min(e,3), p prime, e > 0. [Reinhard Zumkeller, Jan 06 2012]

EXAMPLE

a(96)=24 since the factors of 96 are {1,2,3,4,6,8,12,16,24,32,48,96} but 32, 48 and 96 all contain a 4th power factor (16).

PROG

(Haskell)

a058035 n = product $

   zipWith (^) (a027748_row n) (map (min 3) $ a124010_row n)

-- Reinhard Zumkeller, Jan 06 2012

CROSSREFS

Cf. A007947, A007948, A008835, A046100, A053165.

Cf. A027748, A124010.

Sequence in context: A056962 A043275 A216455 * A057946 A117657 A106618

Adjacent sequences:  A058032 A058033 A058034 * A058036 A058037 A058038

KEYWORD

easy,nonn,mult

AUTHOR

Henry Bottomley, Nov 16 2000

STATUS

approved

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

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

Last modified April 19 17:29 EDT 2014. Contains 240767 sequences.