login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068528 Let N(2n) denote the numerator of B(2n), the 2n-th Bernoulli number and D(2n) the denominator, sequence gives values of n such that gcd(N(2n),D(2n-2))=5. 1
5, 15, 25, 35, 45, 55, 65, 75, 85, 95, 105, 115, 125, 135, 145, 155, 165, 185, 195, 205, 215, 225, 235, 245, 255, 265, 275, 285, 295, 305, 315, 335, 345, 355, 365, 375, 395, 405, 415, 445, 455, 465, 475, 485, 495, 505, 515, 525, 535, 545, 555, 565, 575, 585 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

built with Elemer Labos (LABOS(AT)ana.sote.hu). All terms are of the form 5+10*k. If in almost cases a(n+1)-a(n)=10 there are some jumps : a(18)-a(17)=20.

CROSSREFS

Cf. A007703.

Sequence in context: A172404 A031322 A017329 * A061443 A168010 A197072

Adjacent sequences:  A068525 A068526 A068527 * A068529 A068530 A068531

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 21 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 15:56 EST 2012. Contains 205934 sequences.