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.
%I A083553 #20 Dec 14 2024 17:01:44
%S A083553 2,8,24,60,120,192,288,396,616,840,1080,1440,1680,1932,2392,3016,3480,
%T A083553 3960,4620,5040,5616,6396,7216,8448,9600,10200,10812,11448,12096,
%U A083553 14112,16380,17680,18768,20424,22200,23400,25272,26892,28552,30616,32040
%N A083553 Product of prime(n+1)-1 and prime(n)-1.
%C A083553 The conductor of x*prime(n) + y*prime(n+1); that is, for all k >= a(n), there exist nonnegative integers x and y such that k = x*prime(n) + y*prime(n+1). - _T. D. Noe_, Sep 22 2004
%D A083553 David Bressoud and Stan Wagon, A Course in Computational Number Theory, Key College Pub., 2000, p. 46.
%H A083553 Amiram Eldar, <a href="/A083553/b083553.txt">Table of n, a(n) for n = 1..10000</a>
%F A083553 a(n) = A006093(n+1)*A006093(n) = (prime(n+1)-1)*(prime(n)-1).
%F A083553 a(n) = A037165(n) + 1.
%F A083553 a(n) = 2*A099407(n). - _Antti Karttunen_, Dec 14 2024
%e A083553 n=25: a(25) = (97-1)*(101-1) = 9600.
%t A083553 f[x_] := Prime[x]-1; Table[f[w+1]*f[w], {w, 1, 128}]
%o A083553 (PARI) A083553(n) = ((prime(1+n)-1)*(prime(n)-1)); \\ _Antti Karttunen_, Dec 14 2024
%Y A083553 Cf. A000040, A006093, A058263, A083538-A083555, A099407 (terms halved), A172042 [= A000010(a(n))], A256617.
%Y A083553 One more than A037165.
%Y A083553 Column 3 of A379010.
%K A083553 nonn
%O A083553 1,1
%A A083553 _Labos Elemer_, May 22 2003