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 A358131 #12 Nov 10 2022 16:12:27
%S A358131 0,25,10,50,35,20,75,60,45,30,100,85,70,55,40,125,110,95,80,65,50,150,
%T A358131 135,120,105,90,75,60,175,160,145,130,115,100,85,70,200,185,170,155,
%U A358131 140,125,110,95,80,225,210,195,180,165,150,135,120,105,90,250,235,220,205,190
%N A358131 Triangle T(n,k) read by rows, where each row lists the value of n coins, in cents, using k dimes (10 cents) and n-k quarters (25 cents).
%H A358131 Wikipedia, <a href="https://en.wikipedia.org/wiki/Change-making_problem">Change-making problem</a>
%H A358131 <a href="/index/Mag#change">Index entries for sequences related to making change.</a>
%F A358131 T(n,k) = 10*k + 25*(n-k), 0 <= k <= n.
%e A358131 Triangle begins
%e A358131 n\k | 0 1 2 3 4 5 6 7 8 9 10
%e A358131 ----|----------------------------------------------------------
%e A358131 0 | 0
%e A358131 1 | 25 10
%e A358131 2 | 50 35 20
%e A358131 3 | 75 60 45 30
%e A358131 4 | 100 85 70 55 40
%e A358131 5 | 125 110 95 80 65 50
%e A358131 6 | 150 135 120 105 90 75 60
%e A358131 7 | 175 160 145 130 115 100 85 70
%e A358131 8 | 200 185 170 155 140 125 110 95 80
%e A358131 9 | 225 210 195 180 165 150 135 120 105 90
%e A358131 10 | 250 235 220 205 190 175 160 145 130 115 100
%e A358131 ...
%t A358131 T[n_, k_] := T[n, k] = 10 k + 25 (n - k); Table[T[n, k], {n, 0, 10}, {k, 0, n}] // Flatten
%Y A358131 Cf. A008592 (right diagonal), A008607 (1st column).
%Y A358131 Cf. A351726.
%K A358131 nonn,easy,tabl
%O A358131 0,2
%A A358131 _Wesley Ivan Hurt_, Oct 30 2022