cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A079772 Let C(n) be the n-th composite number; then a(n) is the smallest number > C(n) and not coprime to C(n).

This page as a plain text file.
%I A079772 #8 Dec 05 2013 19:55:58
%S A079772 6,8,10,12,12,14,16,18,18,20,22,24,24,26,30,28,30,30,32,34,36,36,40,
%T A079772 38,40,42,42,44,46,48,48,50,56,52,54,54,56,60,58,60,60,62,64,66,66,70,
%U A079772 68,70,72,72,74,76,78,78,84,80,82,84,84,86,90,88,90,90,92,98,94,96,96,100
%N A079772 Let C(n) be the n-th composite number; then a(n) is the smallest number > C(n) and not coprime to C(n).
%C A079772 a(n) = A002808(n) + A056608(n). - _Vladeta Jovovic_, Jan 31 2003
%F A079772 a(n) = C(n) + smallest prime divisor of C(n).
%e A079772 C(4) = 9 and C(5) = 10 hence a(4) = a(5) = 12.
%e A079772 For 91=7*13 we have 91+7 = 98; for 92=2*2*23 we have 92-2 = 94
%o A079772 (PARI) cminusp31(n) = \sum c+min prime div { for(x=2,n, forprime(p=2,floor(sqrt(x)), if(x%p==0 & isprime(x)==0, print1(x+p,","); break); ) ) }
%K A079772 nonn
%O A079772 1,1
%A A079772 _Amarnath Murthy_, Jan 31 2003
%E A079772 More terms from _Cino Hilliard_, Aug 12 2003