Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A042943
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A042943 C(2^n,n) is divisible by C(2^n,2). +0
1
1, 2, 3, 5, 7, 9, 11, 13, 14, 17, 19, 22, 23, 25, 26, 27, 29, 31, 33, 35, 37, 38, 39, 41, 43, 45, 46, 47, 49, 50, 51, 53, 55, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 75, 77, 79, 81, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 98, 99, 101, 102, 103, 106, 107, 109, 111 (list; graph; listen)
OFFSET

0,2

COMMENT

Does not contain multiples of 4 (A008586).

FORMULA

Mod[A014070, A006516]=Mod[C(2^n, n), C(2^n, 2)]=0

CROSSREFS

A014070, A006516.

Sequence in context: A050748 A079051 A066935 this_sequence A004274 A004280 A053224

Adjacent sequences: A042940 A042941 A042942 this_sequence A042944 A042945 A042946

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 11 2001

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research