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 A160656 #20 Jun 26 2023 12:35:36 %S A160656 0,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89, %T A160656 97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179, %U A160656 181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277 %N A160656 The odd prime numbers together with 0: p - (-1)^p - 1 where p = n-th prime. %F A160656 a(n) = p - (-1)^p - 1 where p is the n-th prime. %F A160656 a(n) = p mod n^2, where p is the n-th prime. - _Gary Detlefs_, Jan 14 2012 %p A160656 seq(ithprime(n) mod n^2, n=1..59) # _Gary Detlefs_, Jan 14 2012 %o A160656 (PARI) a(n)=if(n>1,prime(n)) \\ _Charles R Greathouse IV_, Aug 26 2011 %Y A160656 Cf. A000040, A006005, A158611. %K A160656 nonn,easy,less %O A160656 1,2 %A A160656 _Juri-Stepan Gerasimov_, May 23 2009