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.

A379963 Numbers k such that A276086(k)+1 is a perfect square (A000290), where A276086 is the primorial base exp-function.

This page as a plain text file.
%I A379963 #13 Jan 24 2025 11:59:10
%S A379963 2,8,34,36,214,248,254,2318,2350,2520,2564,2776,5076,30038,30092,
%T A379963 30480,32374,510542,510728,510746,512886,515134,540540,540818,542862,
%U A379963 542888,1021442,9699702,9699722,9699772,9699788,9702010,9702256,9729938,9734358,10210414,10217558,10240472,10240724,19401924,19429870,19912238
%N A379963 Numbers k such that A276086(k)+1 is a perfect square (A000290), where A276086 is the primorial base exp-function.
%H A379963 Antti Karttunen, <a href="/A379963/b379963.txt">Table of n, a(n) for n = 1..82</a>
%H A379963 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>.
%e A379963 A276086(34) = 63, +1 = 64 = 8^2, therefore 34 is included.
%e A379963 A276086(36) = 35, +1 = 36 = 6^2, therefore 36 is included.
%o A379963 (PARI)
%o A379963 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A379963 is_A379963(n) = issquare(1+A276086(n));
%Y A379963 Subsequence of A379962.
%Y A379963 Cf. A000290, A002110, A276086.
%Y A379963 Cf. also A379965 and A328849 (numbers k such that A276086(k) is a square).
%K A379963 nonn
%O A379963 1,1
%A A379963 _Antti Karttunen_, Jan 24 2025