Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Mar 20 2024 11:32:46
%S 26,244,305,338,9755,18205,33076,48775,60707,70673,82690,92410,95990,
%T 101651,112102,165380,167690,184820,191980,211178,224204,232373,
%U 258322,274730,297743,330760,335380,369640,383960,422356,448408,516644,516934,549460,583444
%N Solutions to a certain congruence.
%H Lars Blomberg, <a href="/A275880/b275880.txt">Table of n, a(n) for n = 1..106</a>
%H J. B. Cosgrave and K. Dilcher, <a href="https://doi.org/10.1090/mcom/3111">A role for generalized Fermat numbers</a>, Math. Comp. 86 (304) (2017) 899-933. See Table 2.1.
%F From _Lars Blomberg_, Nov 28 2016: (Start)
%F The Gaussian factorial is G(N,n) = prod_{j=1,N and gcd(j,n)=1} (j).
%F Values n are restricted to the form n=w*p^alfa, with w=q_1^beta_1 * ... * q_s^beta_s and p, q_1, ... q_s are distinct primes, p = 1(mod 3), q_1, ... q_s = -1(mod 3) with s>=0, alfa, beta_1, ... beta_s >=1. The case s = 0 is interpreted as w = 1.
%F Values n must also satisfy G(floor((n-1)/3), n) = 1 (mod n). (End)
%Y Cf. A275881.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Aug 17 2016
%E a(10)-a(35) from _Lars Blomberg_, Nov 28 2016