# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a132767
Showing 1-1 of 1

%I A132767 #47 Feb 20 2023 09:21:51
%S A132767 0,26,54,84,116,150,186,224,264,306,350,396,444,494,546,600,656,714,
%T A132767 774,836,900,966,1034,1104,1176,1250,1326,1404,1484,1566,1650,1736,
%U A132767 1824,1914,2006,2100,2196,2294,2394,2496,2600,2706,2814,2924,3036,3150,3266,3384
%N A132767 a(n) = n*(n + 25).
%C A132767 a(n) is the Zagreb 1 index of the Mycielskian of the cycle graph C[n]. See p. 205 of the D. B. West reference. - _Emeric Deutsch_, Nov 04 2016
%D A132767 Douglas B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall, NJ, 2001.
%H A132767 G. C. Greubel, <a href="/A132767/b132767.txt">Table of n, a(n) for n = 0..5000</a>
%H A132767 Felix P. Muga II, <a href="https://www.researchgate.net/publication/267327689_Extending_the_Golden_Ratio_and_the_Binet-de_Moivre_Formula">Extending the Golden Ratio and the Binet-de Moivre Formula</a>, Preprint on ResearchGate, March 2014.
%H A132767 Wikipedia, <a href="https://en.wikipedia.org/wiki/Mycielskian">Mycielskian</a>.
%H A132767 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A132767 a(n) = 2*n + a(n-1) + 24 (with a(0)=0). - _Vincenzo Librandi_, Aug 03 2010
%F A132767 a(n) = n^2 + 25*n. - _Omar E. Pol_, Nov 04 2016
%F A132767 From _Chai Wah Wu_, Dec 17 2016: (Start)
%F A132767 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2.
%F A132767 G.f.: 2*x*(13 - 12*x)/(1-x)^3. (End)
%F A132767 From _Amiram Eldar_, Jan 16 2021: (Start)
%F A132767 Sum_{n>=1} 1/a(n) = H(25)/25 = A001008(25)/A102928(25) = 34052522467/223092870000, where H(k) is the k-th harmonic number.
%F A132767 Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/25 - 19081066231/669278610000. (End)
%F A132767 E.g.f.: x*(26 + x)*exp(x). - _G. C. Greubel_, Mar 13 2022
%t A132767 Table[n (n + 25), {n, 0, 50}] (* _Bruno Berselli_, Aug 22 2018 *)
%t A132767 LinearRecurrence[{3,-3,1},{0,26,54},60] (* _Harvey P. Dale_, Feb 20 2023 *)
%o A132767 (PARI) a(n)=n*(n+25) \\ _Charles R Greathouse IV_, Jun 17 2017
%o A132767 (Sage) [n*(n+25) for n in (0..50)] # _G. C. Greubel_, Mar 13 2022
%Y A132767 Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569, A098603, A098847, A098848, A098849, A098850, A102928, A120071, A132759, A132760, A132761, A132762, A132763, A132764, A132765, A132766.
%K A132767 nonn,easy
%O A132767 0,2
%A A132767 _Omar E. Pol_, Aug 28 2007

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE