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 A299763 #14 Aug 06 2024 01:59:12
%S A299763 1,3,4,6,8,12,14,18,20,24,30,32,38,42,44,48,54,60,62,68,72,74,80,84,
%T A299763 90,98,102,104,108,110,114,128,132,138,140,150,152,158,164,168,174,
%U A299763 180,182,192,194,198,200,212,224,228,230,234,240,242,252,258,264,270,272,278,282,284
%N A299763 a(n) = 1 + A182986(n).
%C A299763 Are these the indices of the rows of A299762 where there is a record?
%H A299763 G. C. Greubel, <a href="/A299763/b299763.txt">Table of n, a(n) for n = 1..10000</a>
%F A299763 a(n) = A028815(n-1) - [n=1].
%F A299763 a(n) = A008864(n-1) for n >= 2, with a(1) = 1.
%t A299763 A299763[n_]:= If[n==1, 1, Prime[n-1] +1];
%t A299763 Table[A299763[n], {n,70}] (* _G. C. Greubel_, Aug 05 2024 *)
%o A299763 (Magma)
%o A299763 A299763:= func< n | n eq 1 select 1 else NthPrime(n-1) + 1 >;
%o A299763 [A299763(n): n in [1..70]]; // _G. C. Greubel_, Aug 05 2024
%o A299763 (SageMath)
%o A299763 def A299763(n): return 1 if n==1 else nth_prime(n-1) + 1
%o A299763 [A299763(n) for n in range(1,71)] # _G. C. Greubel_, Aug 05 2024
%Y A299763 First differences are in A054541.
%Y A299763 Cf. A008864, A028815, A182986, A299762.
%Y A299763 Essentially the same as A008864, A028815, A055670, A135731, A175216.
%K A299763 nonn,easy
%O A299763 1,2
%A A299763 _Omar E. Pol_, Mar 14 2018