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.

A112601 a(n) = prime(b(n)) where b(n) = b(n-2) + a(n-1) (with b(1)=1, b(2)=2).

This page as a plain text file.
%I A112601 #16 Sep 12 2022 04:39:24
%S A112601 2,3,7,23,103,613,4751,47137,582511,8758339,156819893,3283370969,
%T A112601 79174605361,2171048919947,66970610115763,2302616062156639,
%U A112601 87542957597514007,3654858165039471959
%N A112601 a(n) = prime(b(n)) where b(n) = b(n-2) + a(n-1) (with b(1)=1, b(2)=2).
%t A112601 a[n_] := a[n] = Prime[b[n]]; b[1] = 1; b[2] = 2; b[n_] := b[n] = b[n - 2] + a[n - 1]; Array[a, 15] (* _Robert G. Wilson v_, Dec 22 2005 *)
%Y A112601 Cf. A111392, A112237.
%K A112601 nonn,more
%O A112601 1,1
%A A112601 _Yasutoshi Kohmoto_, Dec 15 2005
%E A112601 Better definition from _Dean Hickerson_, more terms from _Emeric Deutsch_, Dec 17 2005
%E A112601 a(12)-a(15) from _Robert G. Wilson v_, Dec 22 2005
%E A112601 a(16)-a(18) from _Amiram Eldar_, Sep 12 2022