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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184907 Let S_n be the set of the integers having alternating bit sum equal to n. There are a(n) primes among the smallest 2n+1 numbers of S_n. 2
0, 1, 4, 0, 4, 7, 0, 4, 5, 0, 1, 6, 0, 9, 3, 0, 6, 5, 0, 8, 5, 0, 3, 2, 0, 6, 3, 0, 3, 9, 0, 5, 5, 0, 3, 6, 0, 5, 2, 0, 8, 6, 0, 8, 6, 0, 2, 12, 0, 8, 1, 0, 2, 7, 0, 2, 1, 0, 4, 5, 0, 7, 5, 0, 8, 6, 0, 7, 6, 0, 3, 9, 0, 4, 11, 0, 4, 5, 0, 5, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..80.

W. Bomfim, A method to find the first 2n+1 integers having alternating bit sum equal to n

EXAMPLE

The smallest 2n+1 = 5 numbers of the set S_2 of the integers having alternating bit sum 2, are 5, 17, 20, 23, and 29, so a(2)=4.

PROG

(PARI)II()={i = (4^n - 1)/3 - 2^(2*n-2) + 2^(2*n); if(isprime(i), an++)};

III()={w = 2^(2*n-2); for(j=1, n-1, i += w; w /= 4; i -= w; if(isprime(i), an++; ))};

IV()={i+=3; if(isprime(i), an++); w=2; for(j=1, n-1, i -= w; w *= 4; i+=w; if(isprime(i), an++))};

print1("0, 1, 4, "); for(n=3, 80, an=0; II(); III(); IV(); print1(an, ", ")) \\ Washington Bomfim, Jan 25 2011

CROSSREFS

Cf. A065359, A065084, A002450.

Sequence in context: A217220 A303560 A135011 * A127751 A028602 A111767

Adjacent sequences:  A184904 A184905 A184906 * A184908 A184909 A184910

KEYWORD

nonn

AUTHOR

Washington Bomfim, Jan 25 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 04:40 EDT 2019. Contains 325189 sequences. (Running on oeis4.)