Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.
A078612
Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.
Terms
- a(0) =22a(1) =38a(2) =80a(3) =140a(4) =302a(5) =410a(6) =668a(7) =824a(8) =1182a(9) =1832a(10) =2086a(11) =2930a(12) =3572a(13) =3920a(14) =4662a(15) =5892a(16) =7262a(17) =7756a(18) =9320a(19) =10442a(20) =11032a(21) =12884a(22) =14202a(23) =16298a(24) =19310a(25) =20912a(26) =21740a(27) =23438a(28) =24314a(29) =26120
External references
- oeis: A078612