cp's OEIS Frontend

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.

A095085 Fib000 primes, i.e., primes p whose Zeckendorf-expansion A014417(p) ends with three zeros.

This page as a plain text file.
%I A095085 #20 Mar 21 2022 11:49:38
%S A095085 5,13,29,47,73,89,97,107,131,149,157,173,191,199,233,241,251,293,317,
%T A095085 419,461,479,487,521,547,563,631,673,683,691,733,751,809,827,877,911,
%U A095085 919,937,953,971,1013,1021,1039,1063,1097,1123,1249,1259
%N A095085 Fib000 primes, i.e., primes p whose Zeckendorf-expansion A014417(p) ends with three zeros.
%H A095085 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>.
%o A095085 (Python)
%o A095085 from sympy import fibonacci, primerange
%o A095085 def a(n):
%o A095085     k=0
%o A095085     x=0
%o A095085     while n>0:
%o A095085         k=0
%o A095085         while fibonacci(k)<=n: k+=1
%o A095085         x+=10**(k - 3)
%o A095085         n-=fibonacci(k - 1)
%o A095085     return x
%o A095085 def ok(n): return str(a(n))[-3:]=="000"
%o A095085 print([n for n in primerange(1, 1261) if ok(n)]) # _Indranil Ghosh_, Jun 08 2017
%Y A095085 Intersection of A000040 and A101345.
%Y A095085 Cf. A014417, A095065.
%K A095085 nonn,base
%O A095085 1,1
%A A095085 _Antti Karttunen_, Jun 01 2004