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.

A095089 Fib101 primes, i.e., primes p whose Zeckendorf-expansion A014417(p) ends as one, zero, one.

This page as a plain text file.
%I A095089 #17 May 07 2021 13:30:37
%S A095089 17,59,67,101,127,211,271,313,347,373,389,449,457,491,499,593,601,643,
%T A095089 661,677,787,821,881,983,991,1033,1093,1109,1237,1279,1321,1381,1423,
%U A095089 1499,1559,1567,1601,1609,1669,1753,1787,1847,1889,1931,1999
%N A095089 Fib101 primes, i.e., primes p whose Zeckendorf-expansion A014417(p) ends as one, zero, one.
%H A095089 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%o A095089 (Python)
%o A095089 from sympy import fibonacci, primerange
%o A095089 def a(n):
%o A095089     k=0
%o A095089     x=0
%o A095089     while n>0:
%o A095089         k=0
%o A095089         while fibonacci(k)<=n: k+=1
%o A095089         x+=10**(k - 3)
%o A095089         n-=fibonacci(k - 1)
%o A095089     return x
%o A095089 def ok(n): return str(a(n))[-3:]=="101"
%o A095089 print([n for n in primerange(1, 2001) if ok(n)]) # _Indranil Ghosh_, Jun 08 2017
%Y A095089 Intersection of A000040 and A134860. Cf. A014417, A095069.
%K A095089 nonn
%O A095089 1,1
%A A095089 _Antti Karttunen_, Jun 01 2004