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.
%I A131082 #31 Apr 18 2024 09:47:03 %S A131082 15,11,5,1,1,5,11,15,15,11,5,1,1,5,11,15,15,11,5,1,1,5,11,15,15,11,5, %T A131082 1,1,5,11,15,15,11,5,1,1,5,11,15,15,11,5,1,1,5,11,15,15,11,5,1,1,5,11, %U A131082 15,15,11,5,1,1,5,11,15,15,11,5,1,1,5,11,15,15,11,5,1,1,5,11,15,15,11,5,1 %N A131082 Periodic sequence (15, 11, 5, 1, 1, 5, 11, 15). %C A131082 Fifth column of triangular array T defined in A131074. %C A131082 Simple continued fraction of (1728521 + sqrt(3040737300437))/230114 = 15.0894426240... - _R. J. Mathar_, Mar 08 2012 %H A131082 Antti Karttunen, <a href="/A131082/b131082.txt">Table of n, a(n) for n = 1..8192</a> %H A131082 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,-1,1). %F A131082 a(n) = a(n-8). %F A131082 G.f.: x*(15 - 4*x - 6*x^2 - 4*x^3 + 15*x^4)/((1-x)*(1+x^4)). %t A131082 PadRight[{},100,{15,11,5,1,1,5,11,15}] (* or *) LinearRecurrence[ {1,0,0,-1,1},{15,11,5,1,1},100] (* _Harvey P. Dale_, Feb 01 2015 *) %o A131082 (PARI) {m=84; for(n=1, m, r=(n-1)%8; print1(if(r==0||r==7, 15, if(r==1||r==6, 11, if(r==2||r==5, 5, 1))), ","))} %o A131082 (Magma) m:=84; [ [15, 11, 5, 1, 1, 5, 11, 15][(n-1) mod 8 + 1]: n in [1..m] ]; %o A131082 (Scheme) (define (A131082 n) (list-ref '(15 11 5 1 1 5 11 15) (modulo (- n 1) 8))) ;; _Antti Karttunen_, Aug 10 2017 %Y A131082 Cf. A131029, A131074. %K A131082 nonn,easy %O A131082 1,1 %A A131082 _Klaus Brockhaus_, following a suggestion of _Paul Curtz_, Jun 14 2007