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 A180258 #18 Jun 27 2024 22:15:53 %S A180258 2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2, %T A180258 2,2,2,2,3,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,3,2,2,2,2,2, %U A180258 2,3,2,2,4,2,2,3,2,2,2,2,4,2,2,3,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2 %N A180258 a(n) = 2^(q*r) mod p for the n-th odd number with exactly 3 distinct prime factors p < q < r. %H A180258 Charles R Greathouse IV, <a href="/A180258/b180258.txt">Table of n, a(n) for n = 1..10000</a> %e A180258 a(1) = 2^(5*7) mod 3 = 2, because A046389(1) = 105 = 3*5*7 and 3 < 5 < 7. %Y A180258 Cf. A046389, A180197, A180257. %K A180258 nonn %O A180258 1,1 %A A180258 _Juri-Stepan Gerasimov_, Jan 17 2011 %E A180258 More terms and corrected a(28) from _Nathaniel Johnston_, Jan 18 2011