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.

A061766 a(1) = 4; a(n) = smallest composite number of the form k*a(n-1) + 1.

This page as a plain text file.
%I A061766 #7 Jan 17 2025 19:22:42
%S A061766 4,9,10,21,22,45,46,93,94,95,96,289,290,291,292,585,586,1173,1174,
%T A061766 1175,1176,1177,1178,1179,1180,2361,2362,2363,2364,2365,2366,2367,
%U A061766 2368,2369,2370,4741,4742,4743,4744,4745,4746,4747,4748,4749,4750,9501,9502,9503
%N A061766 a(1) = 4; a(n) = smallest composite number of the form k*a(n-1) + 1.
%H A061766 Harvey P. Dale, <a href="/A061766/b061766.txt">Table of n, a(n) for n = 1..1000</a>
%e A061766 After 96 the next term is 289 = 3*96+ 1 as 97 and 193 are both primes.
%t A061766 scp[n_]:=Module[{k=1},While[!CompositeQ[k n+1],k++];k n+1]; NestList[scp,4,50] (* _Harvey P. Dale_, Jan 17 2025 *)
%K A061766 nonn,easy
%O A061766 1,1
%A A061766 _Amarnath Murthy_, May 22 2001
%E A061766 More terms from Larry Reeves (larryr(AT)acm.org), May 29 2001