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.
With[{r = Map[Fibonacci, Range[2, 14]]}, Position[#, {1, 0, 1}][[All, 1]] &@ Table[If[Length@ # < 3, {}, Take[#, -3]] &@ IntegerDigits@ Total@ Map[FromDigits@ PadRight[{1}, Flatten@ #] &@ Reverse@ Position[r, #] &,Abs@ Differences@ NestWhileList[Function[k, k - SelectFirst[Reverse@ r, # < k &]], n + 1, # > 1 &]], {n, 373}]] (* Michael De Vlieger, Jun 09 2017 *)
from sympy import fibonacci
def a(n):
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))[-3:]=="101"
print([n for n in range(4, 501) if ok(n)]) # Indranil Ghosh, Jun 08 2017
from math import isqrt def A134860(n): return 3*(n+isqrt(5*n**2)>>1)+(n<<1)-1 # Chai Wah Wu, Aug 10 2022
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
Comments