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!)
A281332 Greatest prime factor of |A001067(n)|, or 1 if |A001067(n)| = 1. 1
1, 1, 1, 1, 1, 691, 1, 3617, 43867, 617, 593, 2294797, 657931, 362903, 1001259881, 305065927, 151628697551, 26315271553053477373, 154210205991661, 1897170067619, 1520097643918070802691, 1798482437, 67568238839737, 153289748932447906241, 47464429777438199 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = A006530(|A001067(n)|).
If n = A112548(m)/2, a(n) = |A001067(n)|.
EXAMPLE
|A001067(10)| = 174611 = 283*617. So a(10) = 617.
|A001067(16)| = 7709321041217 = 37*683*305065927. So a(16) = 305065927.
MATHEMATICA
Table[FactorInteger[Abs@ Numerator[BernoulliB[2 n]/(2 n)]][[-1, 1]], {n, 25}] (* Michael De Vlieger, Jan 21 2017 *)
PROG
(PARI) a(n) = if(abs(numerator(bernfrac(2*n) / (2*n))) == 1, 1, vecmax(factor(abs(numerator(bernfrac(2*n) / (2*n))))[, 1]));
for(n=1, 25, print1(a(n), ", ")) \\ Indranil Ghosh, Mar 11 2017
CROSSREFS
Sequence in context: A249699 A141588 A281331 * A046968 A255505 A001067
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jan 20 2017
EXTENSIONS
a(20)-a(25) from Michael De Vlieger, Jan 21 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)