Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090793 Minimal numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n-r))) for some integer r and the first m irregular primes including irregularity index > 1. +0
1
52, 80, 95, 134, 114, 141, 213, 187, 211, 274, 338, 312, 312, 292, 370, 350, 456, 486, 445, 502, 428, 465, 488, 591, 471, 540, 615, 558, 527, 513, 563, 636, 658, 659, 722, 583, 681, 789, 667, 602, 631, 632, 603, 902, 873, 626, 703, 785, 832, 670, 743, 764 (list; graph; listen)
OFFSET

1,1

COMMENT

Only even values of r are tested.

FORMULA

Given a = numerator(Bernoulli(2*n)/(2*n)) and b = numerator(a/(2*n-r)) for integer r positive or negative, then n>0 n = p + r/2 For every irregular prime p there is an r such that n is minimum.

PROGRAM

(PARI) \ prestore some ireg primes in iprime[] bernmin(m) = { for(x=1, m, p=iprime[x]; forstep(r=2, p, 2, n=r/2+p; n2=n+n; a = numerator(bernfrac(n2)/(n2)); \ A001067 b = numerator(a/(n2-r)); \ if(a <> b, print(r", "n", "a/b)) if(a <> b, print1(n", ")) ) ) }

CROSSREFS

Cf. A090495 A090496.

Adjacent sequences: A090790 A090791 A090792 this_sequence A090794 A090795 A090796

Sequence in context: A043991 A118148 A111173 this_sequence A090791 A026067 A039475

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Feb 16 2004

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research