A135136 -id:A135136 - cp's OEIS frontend

A137331 a(n) = 1 if the binary weight of n is prime, otherwise 0.

0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1

Offset: 0

George Pollard, Apr 07 2008

			a(0) = 0 (binary). Bits set = 0, 0 not prime -> 0.
a(1) = 1 (binary). Bits set = 1, 1 not prime -> 0.
a(2) = 10 (binary). Bits set = 1, 1 not prime -> 0.
a(3) = 11 (binary). Bits set = 2, 2 prime -> 1.

Begins the same as A135136, but differs starting at a(31).

A000120 := proc(n) add(i,i=convert(n,base,2)) ; end: A010051 := proc(n) if isprime(n) then 1 ; else 0 ; fi ; end: A137331 := proc(n) A010051(A000120(n)) ; end: seq(A137331(n),n=0..200) ; # R. J. Mathar, Apr 09 2008

Table[If[PrimeQ[Plus @@ IntegerDigits[n, 2]], 1, 0], {n, 0, 100}] (* Stefan Steinerberger, Apr 09 2008 *)

f(n)={v=binary(n);s=0;for(k=1,#v,if(v[k]== 1,s++));return(isprime(s))};for(n=0,104,if(f(n),print1("1, "),print1("0, "))) \\ Washington Bomfim, Jan 14 2011

a(n) = A010051(A000120(n)). - R. J. Mathar, Apr 09 2008

More terms from R. J. Mathar and Stefan Steinerberger, Apr 09 2008

A137178 a(n) = sum_(1..n) [S2(n)mod 2 - floor(5*S2(n)/7)mod 2], where S2(n) = binary weight of n.

Original entry on oeis.org

0, 1, 2, 1, 2, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 2, 3, 2, 1, 2, 1, 2, 3, 3, 2, 3, 4, 4, 5, 5, 5, 5, 6, 5, 4, 5, 4, 5, 6, 6, 5, 6, 7, 7, 8, 8, 8, 8, 7, 8, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 11, 10, 11, 10, 11, 12, 12, 11, 12, 13, 13, 14, 14, 14, 14, 13, 14, 15, 15, 16, 16, 16

Offset: 0

Ctibor O. Zizka, Apr 04 2008, Apr 15 2008

The graph of this sequence is a special case of de Rham's fractal curve. In general, the graph of any sequence of the form a(n)=sum_(1..n) [Sk(n)mod m - floor(p*Sk(n)/q)mod m], where Sk(n) is the digit sum of n, n in k-ary notation, p,q,m integers, gives a de Rham fractal curve. The self-symmetries of all of de Rham curves are given by the monoid that describes the symmetries of the infinite binary tree or Cantor set. This so-called period-doubling monoid is a subset of the modular group.

John A. Pelesko, Generalizing the Conway-Hofstadter $10,000 Sequence, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.5.
Klaus Pinn, Order and Chaos in Hofstadter's Q(n) Sequence, arXiv:chao-dyn/9803012, 1998.
Klaus Pinn, A Chaotic Cousin Of Conway's Recursive Sequence, arXiv:cond-mat/9808031, 1998.

Cf. A005185, A010060, A115384, A135585, A135947, A135993, A004001, A004526, A004396, A037915, A135133, A135136.

Accumulate@ Array[Mod[#2, 2] - Mod[Floor[5 #2/7], 2] & @@ {#, DigitCount[#, 2, 1]} &, 85, 0] (* Michael De Vlieger, Jan 23 2019 *)

Converted references to links - R. J. Mathar, Oct 30 2009

cp's OEIS Frontend

A137331 a(n) = 1 if the binary weight of n is prime, otherwise 0.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions