Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086748
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086748 Conjectured values of n such that when C(2k, k) == 1 (mod n) then k is necessarily even. +0
1
3, 5, 9, 13, 15, 21, 23, 25, 27 (list; graph; listen)
OFFSET

0,1

EXAMPLE

C(2k,k) == 1 (mod 9) for k=0,274,280,334,760,766,814,822,838,840,982,1000,1002,....and all computed values of k < 5000 are even. Hence 9 is considered to be in the sequence.

CROSSREFS

Sequence in context: A084593 A102968 A089593 this_sequence A018533 A076052 A050556

Adjacent sequences: A086745 A086746 A086747 this_sequence A086749 A086750 A086751

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 30 2003

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research