Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073409
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073409 Least k such that k!*B(2n) is an integer where B(2n) denotes the 2n-th Bernoulli number. +0
2
3, 5, 7, 5, 11, 13, 3, 17, 19, 11, 23, 13, 3, 29, 31, 17, 3, 37, 3, 41, 43, 23, 47, 17, 11, 53, 19, 29, 59, 61, 3, 17, 67, 5, 71, 73, 3, 5, 79, 41, 83, 43, 3, 89, 31, 47, 3, 97, 3, 101, 103, 53, 107, 109, 23, 113, 7, 59, 3, 61, 3, 5, 127, 17, 131, 67, 3, 137, 139, 71, 3, 73, 3, 149 (list; graph; listen)
OFFSET

1,1

COMMENT

Largest prime factor of A002445, the denominator of the Bernoulli number B(2n). - T. D. Noe (noe(AT)sspectra.com), Mar 31 2004

a((p-1)/2) = p, where p is odd prime. All odd primes appear in this sequence. The very first appearance of odd prime p is a((p-1)/2). - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 31 2006

MATHEMATICA

Table[FactorInteger[Denominator[BernoulliB[2n]]][[ -1, 1]], {n, 100}]

CROSSREFS

Cf. A005097.

Sequence in context: A141574 A141261 A077129 this_sequence A151548 A071581 A084393

Adjacent sequences: A073406 A073407 A073408 this_sequence A073410 A073411 A073412

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 23 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research