|
%I #34 Jul 13 2019 18:00:46
%S 0,0,1,0,0,0,3,4,3,2,-1,1,3,3,1,1,-1,-3,0,1,4,3,4,5,8,9,8,7,6,7,2,6,
%T 10,12,14,14,14,16,16,16,16,16,12,16,18,18,18,14,14,14,14,10,10,6,13,
%U 16,19,20,23,26,27,30,31,30,31,30,31,34,33,32,35,34,31,30,27,22,25,26,29,30,31,32,29,30,27,24,27,28,27,24,23,18,15,12,9,4,-1,5,9,11
%N Number of 0's minus number of 1's among the edge truncated binary representations of the first n prime numbers.
%C By "edge truncated" we mean removing the first and last digit. For prime(3)=5 which has binary representation 101 edge truncating yields the string '0'. If there are 2 digits, then edge truncation yields the empty string ''. We count zero 1's and zero 0's in the empty string. The only cases of this are prime(1)=2 and prime(2)=3 which have binary representations 10 and 11.
%H Rémy Sigrist, <a href="/A308430/b308430.txt">Table of n, a(n) for n = 1..12251</a>
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a308/A308430.java">Java program</a> (github)
%H Jonas K. Sønsteby, <a href="/A308430/a308430_10.png">Graph of 200 terms.</a>
%H Jonas K. Sønsteby, <a href="/A308430/a308430_11.png">Graph of 1000 terms.</a>
%H Jonas K. Sønsteby, <a href="/A308430/a308430_12.png">Graph of 5000 terms.</a>
%H Jonas K. Sønsteby, <a href="/A308430/a308430_13.png">Graph of 10000 terms.</a>
%H Jonas K. Sønsteby, <a href="/A308430/a308430_14.png">Graph of 100000 terms.</a>
%F a(n) = a(n-1) + bitlength(prime(n)_2) - 2 * popcount(prime(n)_2) + 2, n > 1. - _Sean A. Irvine_, May 27 2019
%F a(n) = Sum_{k=2..n} (A035100(k) - 2*A014499(k) + 2) = Sum_{k=2..n} (A070939(A000040(k)) - 2*A000120(A000040(k)) + 2). - _Daniel Suteu_, Jul 13 2019
%o (Python 3)
%o import gmpy2
%o def dec2bin(x):
%o return str(bin(x))[2:]
%o def digitBalance(string):
%o s = 0
%o for char in string:
%o if int(char) > 0:
%o s -= 1
%o else:
%o s += 1
%o return s
%o N = 100 # number of terms
%o seq = [0]
%o prime = 2
%o for i in range(N-1):
%o prime = gmpy2.next_prime(prime)
%o binary = dec2bin(prime)
%o truncated = binary[1:-1]
%o term = seq[-1] + digitBalance(truncated)
%o seq.append(term)
%o print(seq) # _Jonas K. Sønsteby_, May 27 2019
%o (PARI) s=0; forprime (p=2, 541, print1 (s += #binary(p\2)+1-2*hammingweight(p\2) ", ")) \\ _Rémy Sigrist_, Jul 13 2019
%o (Sage)
%o def A308430list(b):
%o L = []; s = 0
%o for p in prime_range(2, b):
%o q = (p//2).digits(2)
%o s += 1 + len(q) - 2*sum(q)
%o L.append(s)
%o return L
%o print(A308430list(542)) # _Peter Luschny_, Jul 13 2019
%Y Cf. A004676, A095375, A014499, A177718, A296062.
%K sign,base,look
%O 1,7
%A _Andrea Fornaciari_, May 26 2019
|
