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 A193249 #25 Sep 08 2022 08:45:58
%S A193249 1,153,755,2107,4509,8261,13663,21015,30617,42769,57771,75923,97525,
%T A193249 122877,152279,186031,224433,267785,316387,370539,430541,496693,
%U A193249 569295,648647,735049,828801,930203,1039555,1157157,1283309,1418311,1562463,1716065,1879417
%N A193249 Snub dodecahedron with faces of centered polygons.
%C A193249 The sequence starts with a central dot and expands outward with (n-1) centered polygonal pyramids producing a snub dodecahedron. Each iteration requires the addition of (n-2) edges and (n-1) vertices to complete the centered polygon of each face. [centered triangles (A005448) and centered pentagons (A005891)]
%H A193249 Bruno Berselli, <a href="/A193249/b193249.txt">Table of n, a(n) for n = 1..1000</a>
%H A193249 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A193249 a(n) = 50*n^3-75*n^2+27*n-1 = (2*n-1)*(25*n^2-25*n+1).
%F A193249 G.f.: x*(1+x)*(1+148*x+x^2)/(1-x)^4. - _Bruno Berselli_, Jul 22 2011
%p A193249 A193249:=n->(2*n-1)*(25*n^2-25*n+1); seq(A193249(n), n=1..50); # _Wesley Ivan Hurt_, Apr 30 2014
%t A193249 Table[(2 n - 1) (25 n^2 - 25 n + 1), {n, 50}] (* _Wesley Ivan Hurt_, Apr 30 2014 *)
%o A193249 (Excel)
%o A193249 =50*ROW()^3-75*ROW()^2+27*ROW()-1 fill down to desired size.
%o A193249 (PARI) for(n=1, 34, print1(50*n^3-75*n^2+27*n-1", ")); \\ _Bruno Berselli_, Jul 21 2011
%o A193249 (Magma) [50*n^3-75*n^2+27*n-1: n in [1..34]]; // _Bruno Berselli_, Jul 22 2011
%K A193249 nonn,easy
%O A193249 1,2
%A A193249 _Craig Ferguson_, Jul 19 2011