%I A097497
%S A097497 3,4,8,11,20,22,32,34,41,56,56,70,80,82,88,100,116,116,130,140,140,154,
%T A097497 160,170,190,200,202,212,214,213,250,256,272,268,296,296,308,322,328,
%U A097497 340,356,352,380,382,392,386,410,442,452,454,460,476,472,496,508,520
%N A097497 Floor( prime(n)*(prime(n)+prime(n+1))/prime(n+1)).
%C A097497 if seq(n+1) - seq(n) = 0 or 2 then prime(n) and prime(n+1) are often 
               twins.
%F A097497 Prime(n) is to prime(n+1) as x is to prime(n)+prime(n+1)
%e A097497 Starting with the second prime: 3 is to 5 as x is to 8. x = 8*3/5 => 
               4
%o A097497 (PARI) p(n) = for(x=1,n,y=prime(x+1)*prime(x+2)/prime(x)+.0;print1(floor(y)",
               "))
%Y A097497 Sequence in context: A001994 A084421 A024786 this_sequence A006167 A137504 
               A109794
%Y A097497 Adjacent sequences: A097494 A097495 A097496 this_sequence A097498 A097499 
               A097500
%K A097497 frac,nonn
%O A097497 1,1
%A A097497 Cino Hilliard (hillcino368(AT)gmail.com), Aug 24 2004