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.
The sequence L(n)=floor(n*r) begins with 1,3,4,6,8,9,11,12,14,16,17,..., which includes the primes L(2)=3, L(7)=11,...
r=(1+5^(1/2))/2; s=r/(r-1); a[n_]:=Floor [n*r]; (* A095280 *) b[n_]:=Floor [n*s]; (* A095281 *) Table[a[n],{n,1,120}] t1={};Do[If[PrimeQ[a[n]], AppendTo[t1,a[n]]],{n,1,600}];t1 t2={};Do[If[PrimeQ[a[n]], AppendTo[t2,n]],{n,1,600}];t2 t3={};Do[If[MemberQ[t1,Prime[n]],AppendTo[t3,n]],{n,1,300}];t3 t4={};Do[If[PrimeQ[b[n]], AppendTo[t4,b[n]]],{n,1,600}];t4 t5={};Do[If[PrimeQ[b[n]], AppendTo[t5,n]],{n,1,600}];t5 t6={};Do[If[MemberQ[t4,Prime[n]],AppendTo[t6,n]],{n,1,300}];t6 (* The lists t1, t2, t3, t4, t5, t6 match the sequences A095280, A184792, A184793, A095281, A184794, A184795 *) Select[Range[600],PrimeQ[Floor[GoldenRatio #]]&] (* Harvey P. Dale, Mar 28 2024 *)
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