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 A083292 #16 Aug 09 2023 23:20:49
%S A083292 0,1,2,3,4,5,6,7,8,9,10,12,14,16,18,20,22,24,26,28,40,43,46,49,52,55,
%T A083292 58,61,64,67,90,94,98,102,106,110,114,118,122,126,160,165,170,175,180,
%U A083292 185,190,195,200,205,250,256,262,268,274,280,286,292,298,304,360,367,374
%N A083292 a(n) = n*floor(n/10) + (n mod 10).
%C A083292 a(n) = T(n,n), as defined in A083291.
%H A083292 N. J. A. Sloane, <a href="/A083292/b083292.txt">Table of n, a(n) for n = 0..10000</a>
%H A083292 <a href="/index/Rec#order_21">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1).
%F A083292 a(n)= +a(n-1) +2*a(n-10) -2*a(n-11) -a(n-20) +a(n-21). - _R. J. Mathar_, Feb 20 2011
%e A083292 a(25) = 25*2 + 5 = 55.
%t A083292 Table[n Floor[n/10]+Mod[n,10],{n,0,70}] (* or *) LinearRecurrence[ {1,0,0,0,0,0,0,0,0,2,-2,0,0,0,0,0,0,0,0,-1,1},{0,1,2,3,4,5,6,7,8,9,10,12,14,16,18,20,22,24,26,28,40},70] (* _Harvey P. Dale_, May 23 2015 *)
%Y A083292 Cf. A083291. Differs from A122618 starting at n = 100.
%K A083292 nonn,easy
%O A083292 0,3
%A A083292 _Reinhard Zumkeller_, Apr 23 2003