Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098240
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098240 Numbers n such that GCD(2n+1, numerator(Bernoulli(4n+2))) is squarefree. +0
3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) for(n=1, 3000, if(issquarefree(gcd(2*n+1, numerator(bernfrac(4*n+2)))), print1(n", "))) - Herman Jamke (hermanjamke(AT)fastmail.fm), Nov 02 2006

CROSSREFS

Complement of A098242.

Sequence in context: A004918 A086044 A130572 this_sequence A023805 A085235 A027855

Adjacent sequences: A098237 A098238 A098239 this_sequence A098241 A098242 A098243

KEYWORD

nonn

AUTHOR

Ralf Stephan, Sep 01 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research