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.

A142717 First (leftmost) odd term in the n-th row of triangle A120070.

This page as a plain text file.
%I A142717 #15 Dec 05 2023 09:22:14
%S A142717 3,5,15,21,35,45,63,77,99,117,143,165,195,221,255,285,323,357,399,437,
%T A142717 483,525,575,621,675,725,783,837,899,957,1023,1085,1155,1221,1295,
%U A142717 1365,1443,1517,1599,1677,1763,1845,1935,2021,2115,2205,2303,2397,2499,2597
%N A142717 First (leftmost) odd term in the n-th row of triangle A120070.
%C A142717 Also: Records sequence of A100181.
%C A142717 The last (rightmost) term in the n-th row of triangle A120070 is A005408(n).
%H A142717 Paolo Xausa, <a href="/A142717/b142717.txt">Table of n, a(n) for n = 1..10000</a>
%H A142717 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-2,1).
%F A142717 First differences: a(n+1)-a(n) = A142954(n).
%F A142717 From _R. J. Mathar_, Oct 24 2008: (Start)
%F A142717 a(n) = (n+1)^2-1 = A000466((n+1)/2) if n odd.
%F A142717 a(n) = (n+1)^2-4 = A078371(n/2-1) if n even.
%F A142717 a(n) = 2*a(n-1) -2*a(n-3) +a(n-4).
%F A142717 G.f.: x(3-x+5x^2-3x^3)/((1+x)(1-x)^3). (End)
%e A142717 The odd terms of A120070 build the irregular triangle
%e A142717   3;
%e A142717   5;
%e A142717   15,7;
%e A142717   21,9;
%e A142717   35,27,11;
%e A142717   45,33,13;
%e A142717   63,55,39,15;
%e A142717 The leftmost column defines this sequence.
%t A142717 A142717[n_]:=(n+1)^2-If[OddQ[n],1,4];Array[A142717,100] (* or *)
%t A142717 LinearRecurrence[{2,0,-2,1},{3,5,15,21},100] (* _Paolo Xausa_, Dec 05 2023 *)
%Y A142717 Cf. A000466, A078371, A100181.
%K A142717 nonn
%O A142717 1,1
%A A142717 _Paul Curtz_, Sep 26 2008
%E A142717 Edited and extended by _R. J. Mathar_, Oct 24 2008