This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022341 Odd Fibbinary numbers; also 4*Fibbinary(n) + 1. 2

%I

%S 1,5,9,17,21,33,37,41,65,69,73,81,85,129,133,137,145,149,161,165,169,

%T 257,261,265,273,277,289,293,297,321,325,329,337,341,513,517,521,529,

%U 533,545,549,553,577,581,585,593,597,641,645,649,657,661,673,677,681

%N Odd Fibbinary numbers; also 4*Fibbinary(n) + 1.

%C Numbers n such that (n+1) does not divide C(3n,n)-C(2n,n) - _Benoit Cloitre_, May 23 2004

%t Select[Range[1, 511, 2], BitAnd[#, 2#] == 0 &] (* _Alonso del Arte_, Jun 18 2012 *)

%o (Python)

%o for n in range(1, 700, 2):

%o if n*2 & n == 0:

%o print str(n)+',',

%Y Cf. A003714.

%Y Cf. A000846.

%Y Cf. A022340.

%K nonn

%O 0,2

%A _Marc LeBrun_

%E More terms from _Benoit Cloitre_, May 23 2004 and _Alonso del Arte_, Jun 18 2012

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 .