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 A361692 #23 Jun 03 2025 15:51:22
%S A361692 16,33,50,67,84,101,118,135,152,169,186,203,220,237,254,271,288,305,
%T A361692 322,339,356,373,390,407,424,441,458,475,492,509,526,543,560,577,594,
%U A361692 611,628,645,662,679,696,713,730,747,764,781,798,815,832,849,866,883,900,917,934,951,968,985,1002,1019
%N A361692 a(n) = 17*n - 1.
%H A361692 Leo Tavares, <a href="/A361692/a361692.jpg">Illustration: Double Diamonds</a>.
%H A361692 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A361692 a(n) = 17*n - 1 = A008599(n) - 1.
%F A361692 a(n) = 2*A008590(n) + n - 1.
%F A361692 a(n) = A008590(n) + A017257(n-1).
%F A361692 From _Elmo R. Oliveira_, Apr 03 2025: (Start)
%F A361692 G.f.: x*(16 + x)/(x - 1)^2.
%F A361692 E.g.f.: exp(x)*(17*x - 1) + 1.
%F A361692 a(n) = 2*a(n-1) - a(n-2) for n > 2. (End)
%t A361692 17*Range[100] - 1 (* _Paolo Xausa_, Aug 30 2024 *)
%t A361692 LinearRecurrence[{2,-1},{16,33},90] (* _Harvey P. Dale_, Jun 03 2025 *)
%Y A361692 Cf. A008590, A008599, A017257.
%K A361692 nonn,easy
%O A361692 1,1
%A A361692 _Leo Tavares_, Mar 20 2023