A147850 Parity of the digits sum of Sum_{j = 8*n-7..8*n} prime(j).

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

Offset: 1

Author

E.J.P. Vening, Nov 15 2008

Keywords

• easy
• nonn
• base
• less

Examples

			2+3+5+7+11+13+17+19 = 1384614 (1+3+8+4+6+1+4) = 27 (1).
23+29+31+37+41+43+47+53 = 5466528 (5+4+6+6+5+2+8) = 36 (0).
461+463+467+479+487+491+499+503 = 69230700 (6+9+2+3+7) = 27 (1).
509+521+523+541+547+557+563+569 = 77862060 (7+7+8+6+2+6) = 36 (0).
		

Crossrefs

Cf. A147781.

Programs

Maple

A127335 := proc(n) add(ithprime(i),i=n..n+7) ; end:
A007953 := proc(n) add(i,i=convert(n,base,10)) ; end:
A147850 := proc(n) A007953(17982*A127335(8*n-7)) mod 2 ; end:
for n from 1 to 200 do printf("%a,",A147850(n)) ; od: # R. J. Mathar, Jan 06 2009

Formula

a(n) = 1 - A147781(n).

a(n) = A007953(17982*A127335(8*n-7)) mod 2. - R. J. Mathar, Jan 06 2009

Extensions

More terms from R. J. Mathar, Jan 06 2009