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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285337 a(n) = denominator of A065642(n)/n. 4
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 4, 1, 1, 1, 1, 3, 1, 1, 8, 1, 5, 1, 1, 1, 3, 1, 4, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 5, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 8, 1, 7, 1, 5, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

PROG

(Scheme) (define (A285337 n) (denominator (/ (A065642 n) n)))

(Python)

from fractions import Fraction

from operator import mul

from sympy import primefactors

def a007947(n): return 1 if n<2 else reduce(mul, primefactors(n))

def a065642(n):

    if n==1: return 1

    r=a007947(n)

    n = n + r

    while a007947(n)!=r:

        n+=r

    return n

def a(n): return Fraction(str(a065642(n))+"/"+str(n)).denominator # Indranil Ghosh, Apr 20 2017

CROSSREFS

Cf. A065642, A285100 (positions of ones), A284342 (positions of terms > 1).

Cf. A285336 for the numerator.

Sequence in context: A115413 A292435 A069283 * A033630 A220122 A101446

Adjacent sequences:  A285334 A285335 A285336 * A285338 A285339 A285340

KEYWORD

nonn,frac

AUTHOR

Antti Karttunen, Apr 19 2017

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 August 18 16:13 EDT 2018. Contains 313833 sequences. (Running on oeis4.)