|
Search: id:A147850
|
|
|
| A147850 |
|
Odd/even binary expansion of summed, partitioned subsequent prime numbers. The sum of 8 subsequent prime numbers is multiplied, forming a new sum. The digits of each sum are added per digit, forming a new sum. The odd or even result is visualized by 0/1. Inverse from A147781 |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) = A007953(17982*A127335(8*n-7)) mod 2. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 06 2009]
|
|
EXAMPLE
|
2+3+5+7+11+13+17+19 = 77 x 27 x 666 = 1384614 (1+3+8+4+6+1+4) = 27 (1) 23+29+31+37+41+43+47+53 = 304 x 27 x 666 = 5466528 (5+4+6+6+5+2+8) = 36 (0) 461+463+467+479+487+491+499+503= 3850 x 27 x 666 = 69230700 (6+9+2+3+7) = 27 (1) 509+521+523+541+547+557+563+569= 4330 x 27 x 666 = 77862060 (7+7+8+6+2+6) = 36 (0)
|
|
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: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 06 2009]
|
|
CROSSREFS
|
Cf. A147781.
Sequence in context: A040053 A004569 A100060 this_sequence A099991 A091069 A087003
Adjacent sequences: A147847 A147848 A147849 this_sequence A147851 A147852 A147853
|
|
KEYWORD
|
easy,nonn,uned
|
|
AUTHOR
|
E. J. Vening (permutate(AT)gmail.com), Nov 15 2008
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 06 2009
|
|
|
Search completed in 0.002 seconds
|
