A095280 Lower Wythoff primes, i.e., primes in A000201.
3, 11, 17, 19, 29, 37, 43, 53, 59, 61, 67, 71, 79, 97, 101, 103, 113, 127, 131, 137, 139, 163, 173, 179, 181, 197, 199, 211, 223, 229, 239, 241, 257, 263, 271, 281, 283, 307, 313, 317, 331, 347, 349, 359, 367, 373, 383, 389, 401, 409, 419, 433
Offset: 1
Keywords
Links
- Robert Israel, Table of n, a(n) for n = 1..10000
- Antti Karttunen and J. Moyer, C-program for computing the initial terms of this sequence
Crossrefs
Programs
-
Maple
R:= NULL: count:= 0: for n from 1 while count < 100 do p:= floor(n*phi); if isprime(p) then R:= R,p; count:= count+1 fi od: R; # Robert Israel, Jan 17 2023
-
Mathematica
(See A184792.)
-
Python
from math import isqrt from itertools import count, islice from sympy import isprime def A095280_gen(): # generator of terms return filter(isprime,((n+isqrt(5*n**2)>>1) for n in count(1))) A095280_list = list(islice(A095280_gen(),30)) # Chai Wah Wu, Aug 16 2022
Comments