login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225821 a(n) = Product_{p | p is prime and p, p-1 both divide n}. 1
1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 10, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 2, 1, 10, 1, 42, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 30, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 6, 1, 10, 1, 2, 1, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) = 2 iff n is even and is a term of A226872. - Daniel Suteu, Jul 28 2019
From Bernard Schott, Jul 30 2019: (Start)
a(n) = n if n = 1, 2, 6, 42, 1806.
a(n) = 6 if n is of the form 2^i*3^j, i and j >= 1, so if n is a term of A033845.
a(n) = 10 if n is of the form 2^i*5^j, i >= 2 and j >= 1.
a(n) = 30 if n is of the form 2^i*3^j*5^k, i >=2, j >= 1 and k >= 1. (End)
LINKS
FORMULA
a(n) = denominator(A031971(n)/n) = gcd(n, A027642(n)). - Daniel Suteu, Jul 28 2019
MATHEMATICA
fa=FactorInteger; d[m_]:= Product[If[IntegerQ[m/(fa[m][[i, 1]]-1)], fa[m][[i, 1]], 1], {i, Length@fa@m}]; Table[d[n], {n, 1, 333}]
PROG
(Sage) def A225821(n) : return prod(p for (p, m) in factor(n) if n%(p-1)==0) # Eric M. Schmidt, Jul 31 2013
(PARI) a(n)=my(f=factor(n)[, 1]); prod(i=1, #f, if(n%(f[i]-1)==0, f[i], 1)) \\ Charles R Greathouse IV, Nov 13 2013
CROSSREFS
Sequence in context: A071416 A053589 A055770 * A368777 A113766 A204992
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 07:38 EDT 2024. Contains 371782 sequences. (Running on oeis4.)