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