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.
r = Map[Fibonacci, Range[2, 12]]; Select[Prime@ Range@ 144, Last@ Flatten@ Map[Position[r, #] &, Abs@ Differences@ NestWhileList[Function[k, k - SelectFirst[Reverse@ r, # < k &]], # + 1, # > 1 &]] == 1 &] (* Michael De Vlieger, Mar 27 2016, Version 10 *)
genit(maxx)={for(n=1,maxx,q=(n-1)+(n+sqrtint(5*n^2))\2; if(isprime(q), print1(q,",")));} \\ Bill McEachen, Mar 26 2016
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))[-1]=="1"
print([n for n in primerange(1, 1001) if ok(n)]) # Indranil Ghosh, Jun 07 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
Comments