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.
A095096 := proc(n) option remember; local a; if n =1 then 0; else for a from procname(n-1)+1 do if A095076(a) = 0 then return a; end if; end do: end if; end proc: seq(A095096(n),n=1..60) ; # R. J. Mathar, Sep 22 2020
Flatten @ Position[Mod[DigitCount[Select[Range[0, 1000], BitAnd[#, 2 #] == 0 &], 2, 1], 2], 0] - 1 (* Amiram Eldar, Feb 05 2023 *)
Select[Flatten[Position[Mod[DigitCount[Select[Range[0, 5000], BitAnd[#, 2 #] == 0 &], 2, 1], 2], 1]] - 1, PrimeQ] (* Amiram Eldar, Feb 07 2023 *)
from sympy import fibonacci, primerange
def a(n):
k=0
x=0
while n>0:
k=0
while fibonacci(k)<=n: k+=1
x+=10**(k - 3)
n-=fibonacci(k - 1)
return x
def ok(n): return str(a(n)).count("1")%2
print([n for n in primerange(1, 1001) if ok(n)]) # Indranil Ghosh, Jun 08 2017
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
(See A184792.)
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
from math import isqrt from itertools import count, islice from sympy import isprime def A095281_gen(): # generator of terms return filter(isprime,((n+isqrt(5*n**2)>>1)+n for n in count(1))) A095281_list = list(islice(A095281_gen(),30)) # Chai Wah Wu, Aug 16 2022
Comments