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.

A362923 G.f. = (3*x^4+5*x^2+6*x-7)/(4*x^7+x^4+x^2+x-1).

This page as a plain text file.
%I A362923 #14 Nov 14 2023 03:27:15
%S A362923 7,1,3,4,11,16,30,78,123,229,398,749,1334,2432,4476,8149,14875,27048,
%T A362923 49395,89928,163926,298806,544723,992957,1809798,3299141,6013374,
%U A362923 10961176,19979572,36418781,66383555,121002704,220562395,402037376,732828030,1335786398,2434851947,4438209941
%N A362923 G.f. = (3*x^4+5*x^2+6*x-7)/(4*x^7+x^4+x^2+x-1).
%H A362923 Paolo Xausa, <a href="/A362923/b362923.txt">Table of n, a(n) for n = 0..1000</a>
%H A362923 Robert Dougherty-Bliss and Doron Zeilberger, <a href="https://arxiv.org/abs/2307.16069v1">Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes</a>, arXiv:2307.16069 [math.NT], 2023.
%H A362923 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,1,0,0,4).
%F A362923 a(n) = a(n-1) + a(n-2) + a(n-4) + 4*a(n-7) for n > 6. - _Chai Wah Wu_, Aug 05 2023
%t A362923 LinearRecurrence[{1,1,0,1,0,0,4},{7,1,3,4,11,16,30},50] (* _Paolo Xausa_, Nov 14 2023 *)
%Y A362923 Suggested by A364701.
%K A362923 nonn
%O A362923 0,1
%A A362923 _N. J. A. Sloane_, Aug 05 2023