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.

A073762 a(n) = 24*n - 12.

This page as a plain text file.
%I A073762 #48 Apr 04 2025 10:07:10
%S A073762 12,36,60,84,108,132,156,180,204,228,252,276,300,324,348,372,396,420,
%T A073762 444,468,492,516,540,564,588,612,636,660,684,708,732,756,780,804,828,
%U A073762 852,876,900,924,948,972,996,1020,1044,1068,1092,1116,1140,1164,1188,1212
%N A073762 a(n) = 24*n - 12.
%C A073762 Previous name: "Smallest unrelated number belonging to a term of this sequence equals 8."
%C A073762 This is also the list of numbers k such that A259748(k)/k = 5/12. - _José María Grau Ribas_, Jul 12 2015.
%C A073762 Also the total number of line segments creating a stellated octahedron, where the length of each stellated edge equals n-1, and where the octahedron has 12 edges, each fixed at unit length. - _Peter M. Chema_, Apr 28 2016
%H A073762 Vincenzo Librandi, <a href="/A073762/b073762.txt">Table of n, a(n) for n = 1..3000</a>
%H A073762 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A073762 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A073762 Min{URS[m]} = 8, where UNR[m] = Complement[RRS[m], Divisors[m]].
%F A073762 a(n) = 24*n - 12. - _Max Alekseyev_, Mar 03 2007
%F A073762 a(n) = 12*A005408(n-1). - _Danny Rorabaugh_, Oct 22 2015
%F A073762 G.f.: 12*x*(1 + x)/(1 - x)^2. - _Ilya Gutkovskiy_, Apr 28 2016
%F A073762 Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/48. - _Amiram Eldar_, Feb 28 2023
%F A073762 From _Elmo R. Oliveira_, Apr 04 2025: (Start)
%F A073762 E.g.f.: 12*(exp(x)*(2*x - 1) + 1).
%F A073762 a(n) = 2*a(n-1) - a(n-2) for n > 2. (End)
%e A073762 URSet[12] = {8,9,10} so 12 is here.
%t A073762 tn[x_] := Table[w, {w, 1, x}]; di[x_] := Divisors[x]; dr[x_] := Union[di[x], rrs[x]]; rrs[x_] := Flatten[Position[GCD[tn[x], x], 1]]; unr[x_] := Complement[tn[x], dr[x]]; Do[s=Min[unr[n]]; If[Equal[s, 8], Print[n]], {n, 1, 1000}]
%t A073762 Range[12, 2000, 24] (* _Vladimir Joseph Stephan Orlovsky_, Jun 14 2011 *)
%o A073762 (PARI) a(n)=24*n-12 \\ _Charles R Greathouse IV_, Jun 14 2011
%o A073762 (PARI) x='x+O('x^100); Vec(12*(1+x)/(1-x)^2) \\ _Altug Alkan_, Oct 22 2015
%o A073762 (Magma) [24*n-12: n in [1..60]]; // _Vincenzo Librandi_, Jun 15 2011
%Y A073762 Cf. A005408, A016825, A045763, A073758, A073759, A073760, A259748.
%K A073762 nonn,easy
%O A073762 1,1
%A A073762 _Labos Elemer_, Aug 08 2002