|
%I #5 Mar 30 2012 17:27:56
%S 2,3,1,1,2,4,3,1,1,2,2,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,2,3,1,1,2,1,2,
%T 4,1,1,1,1,2,1,1,1,1,1,1,2,1,2,2,1,1,1,1,2,1,1,1,2,1,1,1,6,1,4,2,1,1,
%U 1,1,1,1,1,1,1,1,1,1,4,1,1,2,2,2,2,1,1,2,1,1,1,1,1,1,1,1,2,1,1,2,1,1,1,2,1
%N Count of links in n-th maximal chain of primes.
%C One less than count of members of n-th maximal chain of primes. For definitions see A152658.
%H Klaus Brockhaus, <a href="/A152735/b152735.txt">Table of n, a(n) for n=1..1000</a>
%e The consecutive primes 5, 7, 11 form the first maximal chain of primes (see example in A152658); it has three members, two links. Therefore a(1) = 2.
%o (PARI) {n=1; while(n<560, c=0; while(isprime(n*prime(n)+(n+1)*prime(n+1)), c++; n++); if(c>0, print1(c, ",")); n++)}
%Y Cf. A152658 (beginnings of maximal chains of primes), A152657 (secluded primes), A119487 (primes of the form i*(i-th prime) + (i+1)*((i+1)-th prime), linking primes).
%K nonn
%O 1,1
%A _Klaus Brockhaus_, Dec 16 2008
|
