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.
lista(nn) = forprime(p=2, nn, if (isprime(p-2) && ((p % 9) == 1), print1(p, ", "))); \\ Michel Marcus, Nov 12 2017
Filtered(List([1..100],n->6*n-1),IsPrime); # Muniru A Asiru, May 19 2018
a007528 n = a007528_list !! (n-1) a007528_list = [x | k <- [0..], let x = 6 * k + 5, a010051' x == 1] -- Reinhard Zumkeller, Jul 13 2012
select(isprime,[seq(6*n-1,n=1..100)]); # Muniru A Asiru, May 19 2018
Select[6 Range[100]-1,PrimeQ] (* Harvey P. Dale, Feb 14 2011 *)
forprime(p=2, 1e3, if(p%6==5, print1(p, ", "))) \\ Charles R Greathouse IV, Jul 15 2011
forprimestep(p=5,1000,6, print1(p", ")) \\ Charles R Greathouse IV, Mar 03 2025
Prime(5) = 11, 1 + 1 = 2 hence a(5) = 2. a(297)=7 because the 297th prime is 1951 and 1+9+5+1 = 16 -> 1+6 = 7.
a038194 = flip mod 9 . a000040 -- Reinhard Zumkeller, Dec 10 2014
[p mod 9: p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014
A038194 := proc(n) return ithprime(n) mod 9: end: seq(A038194(n), n=1..100); # Nathaniel Johnston, May 04 2011
Table[Mod[Prime[n], 9], {n, 200}]
Mod[Prime[Range[100]], 9] (* Vincenzo Librandi, May 06 2014 *)
forprime(p=2,600,print1(p%9,","))
[a: n in [0..250] | IsPrime(a) where a is 9*n - 1 ]; // Vincenzo Librandi, Jun 07 2015
select(isprime, [seq(18*i-1,i=1..1000)]); # Robert Israel, Sep 03 2014
Select[ Range[ 2500 ], PrimeQ[ # ] && Mod[ #, 9 ] == 8 & ] Select[9*Range[300] - 1, PrimeQ]
select( {is(n)=n%9==8&&isprime(n)}, primes([1,2000])) \\ M. F. Hasler, Mar 10 2022
from sympy import prime A061242 = [p for p in (prime(n) for n in range(1,10**3)) if not (p+1) % 18] # Chai Wah Wu, Sep 02 2014
[ p: p in PrimesUpTo(2000) | p mod 9 in {2} ]; // Vincenzo Librandi, Dec 25 2010
Select[ Range[ 2000 ], PrimeQ[ # ] && Mod[ #, 9 ] == 2 & ]
Join[{2}, Select[Range[11, 5000, 18], PrimeQ]] (* Vladimir Joseph Stephan Orlovsky, Jul 13 2011 *) (* ~30 times faster *)
select(n->n%9==2, primes(400)) \\ Charles R Greathouse IV, May 27 2014
[ p: p in PrimesUpTo(2000) | p mod 9 in {5} ]; // Vincenzo Librandi, Dec 25 2010
Select[ Range[ 2500 ], PrimeQ[ # ] && Mod[ #, 9 ] == 5 & ] Select[Prime[Range[300]],Mod[#,9]==5&] (* Harvey P. Dale, Oct 13 2017 *)
select(p->p%9==5,primes(1000)) \\ Charles R Greathouse IV, Sep 26 2012
[p: p in PrimesUpTo(10000) | &+Intseq(p) eq 10]; // Vincenzo Librandi, Jul 08 2014
a:=proc(n) local nn: nn:=convert(n,base,10): if isprime(n)=true and add(nn[j], j=1..nops(nn))=10 then n else end if end proc: seq(a(n),n=1..10^4); # Emeric Deutsch, Mar 06 2008
Select[Prime[Range[100000]], Total[IntegerDigits[#]]==10 &] (* Vincenzo Librandi, Jul 08 2014 *)
forprime(p=19,8101,if(10==sumdigits(p),print(p","))) \\ Zak Seidov, Oct 08 2016
(A107579_nxt(p)=until(isprime(p=A228915(p)),); p); A107579_first(N=100)=vector(N, i, p=if(i>1, A107579_nxt(p), 19)) \\ M. F. Hasler, Mar 15 2022
from itertools import count, islice
from sympy import isprime
from sympy.utilities.iterables import multiset_permutations
def agen(b=10, sod=10): # generator for any base, sum-of-digits
if 0 <= sod < b:
yield sod
nzdigs = [i for i in range(1, b) if i <= sod]
nzmultiset = []
for d in range(1, b):
nzmultiset += [d]*(sod//d)
for d in count(2):
fullmultiset = [0]*(d-1-(sod-1)//(b-1)) + nzmultiset
for firstdig in nzdigs:
target_sum, restmultiset = sod - int(firstdig), fullmultiset[:]
restmultiset.remove(firstdig)
for p in multiset_permutations(restmultiset, d-1):
if sum(p) == target_sum:
t = int("".join(map(str, [firstdig]+p)), b)
if isprime(t):
yield t
if p[0] == target_sum:
break
print(list(islice(agen(), 45))) # Michael S. Branicky, Mar 10 2022
from sympy import isprime def A107579(p=19): "Return a generator of the sequence of all primes >= p with the same digit sum as p." while True: if isprime(p): yield p p = A228915(p) # skip to next larger integer with the same digit sum a=A107579(); [next(a) for in range(50)] # _M. F. Hasler, Mar 16 2022
[p: p in PrimesUpTo(2000) | p mod 9 eq 7]; // Vincenzo Librandi, Dec 25 2010
select(isprime,[seq(9*i+7,i=0..10^5)]); # Robert Israel, Apr 20 2014
Select[Range[2500], PrimeQ[#] && Mod[#, 9] == 7 &] Select[Prime[Range[300]], Mod[#, 9] == 7 & ] (* Harvey P. Dale, Apr 30 2011 *)
select(n->n%9==7, primes(400)) \\ Charles R Greathouse IV, May 27 2014
Filtered([1..4000],n->n mod 11=1 and IsPrime(n)); # Muniru A Asiru, Apr 19 2018
[ p: p in PrimesUpTo(5000) | p mod 11 eq 1 ]; // Vincenzo Librandi, Apr 19 2011
a:=select(n->isprime(n) and modp(n,11)=1,[$1..4000]); # Muniru A Asiru, Apr 19 2018
Select[Range[1,10000,11],PrimeQ] (* Vladimir Joseph Stephan Orlovsky, May 18 2011 *)
is(n)=isprime(n) && n%11==1 \\ Charles R Greathouse IV, Jul 01 2016
forstep(n=2, 1e3, 2, if(isprime(p=11*n+1), print1(p, ", "))); \\ Altug Alkan, Apr 19 2018
[ p: p in PrimesUpTo(2000) | p mod 9 in {4} ]; // Vincenzo Librandi, Dec 25 2010
Select[ Range[ 2000 ], PrimeQ[ # ] && Mod[ #, 9 ] == 4 & ] Select[Prime[Range[300]],Mod[#,9]==4&] (* Harvey P. Dale, Aug 20 2015 *)
select(n->n%9==4, primes(400)) \\ Charles R Greathouse IV, May 27 2014
Comments