login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A181812
Range of values of A181811, in order of first appearance: a(n) = A181811(2n-1).
5
1, 2, 6, 30, 4, 210, 2310, 12, 30030, 510510, 60, 9699690, 36, 8, 223092870, 6469693230, 420, 180, 200560490130, 4620, 7420738134810, 304250263527210, 24, 13082761331670030, 900, 60060, 614889782588491410, 1260, 1021020, 32589158477190044730
OFFSET
1,2
COMMENTS
a(n)=smallest integer that, upon multiplying any divisor of the n-th odd positive integer (A005408(n)), produces a member of A025487.
A permutation of the members of A025487.
LINKS
FORMULA
If 2n-1 = Product p(i)^e(i), then a(n) = Product A002110(i-1)^e(i). I.e., a(n)= A181811(A005408(n)).
EXAMPLE
For any divisor d of 15 (d = 1, 3, 5, 15), 12d (12, 36, 60, 180) is always a member of A025487. 12 is the smallest integer with this relationship to 15; therefore, since 15 = A005408(8), a(8)=12.
PROG
(Python)
from sympy import primerange, factorint
from operator import mul
def P(n): return reduce(mul, [i for i in primerange(2, n + 1)])
def a181811(n):
f = factorint(n)
return 1 if n==1 else (reduce(mul, [P(i)**f[i] for i in f]))/n
def a(n): return a181811(2*n - 1) # Indranil Ghosh, May 15 2017
CROSSREFS
Sequence in context: A348879 A326900 A373350 * A330648 A354418 A074168
KEYWORD
nonn
AUTHOR
Matthew Vandermast, Nov 30 2010
STATUS
approved