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.
F:= combinat[fibonacci]:
b:= proc(n) option remember; local j;
if n=0 then 0
else for j from 2 while F(j+1)<=n do od;
b(n-F(j))+2^(j-2)
fi
end:
a:= proc(n) option remember; local p;
p:= `if`(n=1, 1, a(n-1));
do p:= nextprime(p);
if b(p)::even then break fi
od; p
end:
seq(a(n), n=1..100); # Alois P. Heinz, Mar 27 2016
F = Fibonacci;
b[n_] := b[n] = Module[{j},
If[n == 0, 0, For[j = 2, F[j + 1] <= n, j++];
b[n - F[j]] + 2^(j - 2)]];
a[n_] := a[n] = Module[{p},
p = If[n == 1, 1, a[n - 1]]; While[True,
p = NextPrime[p]; If[ EvenQ[b[p]], Break[]]]; p];
Array[a, 100] (* Jean-François Alcover, Jul 01 2021, after Alois P. Heinz *)
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]=="0"
print([n for n in primerange(1, 1001) if ok(n)]) # Indranil Ghosh, Jun 07 2017
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