A078371 -id:A078371 - cp's OEIS frontend

A046092 4 times triangular numbers: a(n) = 2n(n+1).

0, 4, 12, 24, 40, 60, 84, 112, 144, 180, 220, 264, 312, 364, 420, 480, 544, 612, 684, 760, 840, 924, 1012, 1104, 1200, 1300, 1404, 1512, 1624, 1740, 1860, 1984, 2112, 2244, 2380, 2520, 2664, 2812, 2964, 3120, 3280, 3444, 3612, 3784, 3960, 4140, 4324

Offset: 0

N. J. A. Sloane and Eric W. Weisstein

Consider all Pythagorean triples (X,Y,Z=Y+1) ordered by increasing Z; sequence gives Y values. X values are 1, 3, 5, 7, 9, ... (A005408), Z values are A001844.
In the triple (X, Y, Z) we have X^2=Y+Z. Actually, the triple is given by {x, (x^2 -+ 1)/2}, where x runs over the odd numbers (A005408) and x^2 over the odd squares (A016754). - Lekraj Beedassy, Jun 11 2004
a(n) is the number of edges in n X n square grid with all horizontal and vertical segments filled in. - Asher Auel, Jan 12 2000 [Corrected by Felix Huber, Apr 09 2024]
a(n) is the only number satisfying an inequality related to zeta(2) and zeta(3): Sum_{i>a(n)+1} 1/i^2 < Sum_{i>n} 1/i^3 < Sum_{i>a(n)} 1/i^2. - Benoit Cloitre, Nov 02 2001
Number of right triangles made from vertices of a regular n-gon when n is even. - Sen-Peng Eu, Apr 05 2001
Number of ways to change two non-identical letters in the word aabbccdd..., where there are n type of letters. - Zerinvary Lajos, Feb 15 2005
a(n) is the number of (n-1)-dimensional sides of an (n+1)-dimensional hypercube (e.g., squares have 4 corners, cubes have 12 edges, etc.). - Freek van Walderveen (freek_is(AT)vanwal.nl), Nov 11 2005
From Nikolaos Diamantis (nikos7am(AT)yahoo.com), May 23 2006: (Start)
Consider a triangle, a pentagon, a heptagon, ..., a k-gon where k is odd. We label a triangle with n=1, a pentagon with n=2, ..., a k-gon with n = floor(k/2). Imagine a player standing at each vertex of the k-gon.
Initially there are 2 frisbees, one held by each of two neighboring players. Every time they throw the frisbee to one of their two nearest neighbors with equal probability. Then a(n) gives the average number of steps needed so that the frisbees meet.
I verified this by simulating the processes with a computer program. For example, a(2) = 12 because in a pentagon that's the expected number of trials we need to perform. That is an exercise in Concrete Mathematics and it can be done using generating functions. (End)
A diagonal of A059056. - Zerinvary Lajos, Jun 18 2007
If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n-1) is equal to the number of 2-subsets of X containing none of X_i, (i=1,...,n). - Milan Janjic, Jul 16 2007
X values of solutions to the equation 2*X^3 + X^2 = Y^2. To find Y values: b(n) = 2n(n+1)(2n+1). - Mohamed Bouhamida, Nov 06 2007
Number of (n+1)-permutations of 3 objects u,v,w, with repetition allowed, containing n-1 u's. Example: a(1)=4 because we have vv, vw, wv and ww; a(2)=12 because we can place u in each of the previous four 2-permutations either in front, or in the middle, or at the end. - Zerinvary Lajos, Dec 27 2007
Sequence found by reading the line from 0, in the direction 0, 4, ... and the same line from 0, in the direction 0, 12, ..., in the square spiral whose vertices are the triangular numbers A000217. - Omar E. Pol, May 03 2008
a(n) is also the least weight of self-conjugate partitions having n different even parts. - Augustine O. Munagi, Dec 18 2008
From Peter Luschny, Jul 12 2009: (Start)
The general formula for alternating sums of powers of even integers is in terms of the Swiss-Knife polynomials P(n,x) A153641 (P(n,1)-(-1)^k P(n,2k+1))/2. Here n=2, thus
a(k) = |(P(2,1) - (-1)^k*P(2,2k+1))/2|. (End)
The sum of squares of n+1 consecutive numbers between a(n)-n and a(n) inclusive equals the sum of squares of n consecutive numbers following a(n). For example, for n = 2, a(2) = 12, and the corresponding equation is 10^2 + 11^2 + 12^2 = 13^2 + 14^2. - Tanya Khovanova, Jul 20 2009
Number of roots in the root system of type D_{n+1} (for n>2). - Tom Edgar, Nov 05 2013
Draw n ellipses in the plane (n>0), any 2 meeting in 4 points; sequence gives number of intersections of these ellipses (cf. A051890, A001844); a(n) = A051890(n+1) - 2 = A001844(n) - 1. - Jaroslav Krizek, Dec 27 2013
a(n) appears also as the second member of the quartet [p0(n), a(n), p2(n), p3(n)] of the square of [n, n+1, n+2, n+3] in the Clifford algebra Cl_2 for n >= 0. p0(n) = -A147973(n+3), p2(n) = A054000(n+1) and p3(n) = A139570(n). See a comment on A147973, also with a reference. - Wolfdieter Lang, Oct 15 2014
a(n) appears also as the third and fourth member of the quartet [p0(n), p0(n), a(n), a(n)] of the square of [n, n, n+1, n+1] in the Clifford algebra Cl_2 for n >= 0. p0(n) = A001105(n). - Wolfdieter Lang, Oct 16 2014
Consider two equal rectangles composed of unit squares. Then surround the 1st rectangle with 1-unit-wide layers to build larger rectangles, and surround the 2nd rectangle just to hide the previous layers. If r(n) and h(n) are the number of unit squares needed for n layers in the 1st case and the 2nd case, then for all rectangles, we have a(n) = r(n) - h(n) for n>=1. - Michel Marcus, Sep 28 2015
When greater than 4, a(n) is the perimeter of a Pythagorean triangle with an even short leg 2*n. - Agola Kisira Odero, Apr 26 2016
Also the number of minimum connected dominating sets in the (n+1)-cocktail party graph. - Eric W. Weisstein, Jun 29 2017
a(n+1) is the harmonic mean of A000384(n+2) and A014105(n+1). - Bob Andriesse, Apr 27 2019
Consider a circular cake from which wedges of equal center angle c are cut out in clockwise succession and turned around so that the bottom comes to the top. This goes on until the cake shows its initial surface again. An interesting case occurs if 360°/c is not an integer. Then, with n = floor(360°/c), the number of wedges which have to be cut out and turned equals a(n). (For the number of cutting line segments see A005408.) - According to Peter Winkler's book "Mathematical Mind-Benders", which presents the problem and its solution (see Winkler, pp. 111, 115) the problem seems to be of French origin but little is known about its history. - Manfred Boergens, Apr 05 2022
a(n-3) is the maximum irregularity over all maximal 2-degenerate graphs with n vertices.  The extremal graphs are 2-stars (K_2 joined to n-2 independent vertices).  (The irregularity of a graph is the sum of the differences between the degrees over all edges of the graph.) - Allan Bickle, May 29 2023
Number of ways of placing a domino on a (n+1)X(n+1) board of squares. - R. J. Mathar, Apr 24 2024
The sequence terms are the exponents in the expansion of (1/(1 + x)) * Sum_{n >= 0} x^n * Product_{k = 1..n} (1 - x^(2*k-1))/(1 + x^(2*k+1)) = 1 - x^4 + x^12 - x^24 + x^40 - x^60 + - ... (Andrews and Berndt, Entry 9.3.3, p. 229). Cf. A153140. - Peter Bala, Feb 15 2025
Number of edges in an (n+1)-dimensional orthoplex. 2D orthoplexes (diamonds) have 4 edges, 3D orthoplexes (octahedrons) have 12 edges, 4D orthoplexes (16-cell) have 24 edges, and so on. - Aaron Franke, Mar 23 2025

			a(7)=112 because 112 = 2*7*(7+1).
The first few triples are (1,0,1), (3,4,5), (5,12,13), (7,24,25), ...
The first such partitions, corresponding to a(n)=1,2,3,4, are 2+2, 4+4+2+2, 6+6+4+4+2+2, 8+8+6+6+4+4+2+2. - _Augustine O. Munagi_, Dec 18 2008

George E. Andrews and Bruce C. Berndt, Ramanujan's Lost Notebook, Part I, Springer, 2005.
Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 3.
Albert H. Beiler, Recreations in the Theory of Numbers. New York: Dover, p. 125, 1964.
Ronald L. Graham, D. E. Knuth and Oren Patashnik, Concrete Mathematics, Reading, Massachusetts: Addison-Wesley, 1994.
Peter Winkler, Mathematical Mind-Benders, Wellesley, Massachusetts: A K Peters, 2007.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Allan Bickle and Zhongyuan Che, Irregularities of Maximal k-degenerate Graphs, Discrete Applied Math. 331 (2023) 70-87.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
H. J. Brothers, Pascal's Prism: Supplementary Material.
Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, preprint, 2016.
Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, Vol. 13, No. 4 (2017), Article #47.
Z. Janelidze, F. van Niekerk, and J. Viljoen, What is the maximal connected partial symmetry index of a connected graph of a given size?, arXiv:2502.00704 [math.CO], 2025. See p. 3.
Milan Janjic, Two Enumerative Functions
Ron Knott, Pythagorean Triples and Online Calculators
Tanya Khovanova, A Miracle Equation.
Augustine O. Munagi, Pairing conjugate partitions by residue classes, Discrete Math., 308 (2008), 2492-2501. [From _Augustine O. Munagi_, Dec 18 2008]
Enrique Navarrete and Daniel Orellana, Finding Prime Numbers as Fixed Points of Sequences, arXiv:1907.10023 [math.NT], 2019.
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Amelia Carolina Sparavigna, The groupoids of Mersenne, Fermat, Cullen, Woodall and other Numbers and their representations by means of integer sequences, Politecnico di Torino, Italy (2019), [math.NT].
Amelia Carolina Sparavigna, Some Groupoids and their Representations by Means of Integer Sequences, International Journal of Sciences (2019) Vol. 8, No. 10.
Rusliansyah D. Suprijanto, Observation on Sums of Powers of Integers Divisible by Four, Applied Mathematical Sciences, Vol. 8, 2014, no. 45, 2219 - 2226.
Leo Tavares, Illustration: Diamond Rows
Herman Tulleken, Polyominoes 2.2: How they fit together, (2019).
Eric Weisstein's World of Mathematics, Aztec Diamond.
Eric Weisstein's World of Mathematics, Cocktail Party Graph.
Eric Weisstein's World of Mathematics, Connected Dominating Set.
Eric Weisstein's World of Mathematics, Gear Graph.
Eric Weisstein's World of Mathematics, Hamiltonian Path.
Eric Weisstein's World of Mathematics, Pythagorean Triple.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A045943, A028895, A002943, A054000, A000330, A007290, A002378, A033996, A124080, A028896, A049598, A005563, A000217, A033586, A085250.
Main diagonal of array in A001477.
Equals A033996/2. Cf. A001844. - Augustine O. Munagi, Dec 18 2008
Cf. A078371, A141530 (see Librandi's comment in A078371).
Cf. A097080, A001845.
Cf. similar sequences listed in A299645.
Cf. A005408.
Cf. A016754.
Cf. A002378, A046092, A028896 (irregularities of maximal k-degenerate graphs).

a046092 = (* 2) . a002378  -- Reinhard Zumkeller, Dec 15 2013

[2*n*(n+1): n in [0..50]]; // Vincenzo Librandi, Oct 04 2011

Table[2 n (n + 1), {n, 0, 50}] (* Stefan Steinerberger, Apr 03 2006 *)
LinearRecurrence[{3, -3, 1}, {0, 4, 12}, 50] (* Harvey P. Dale, Jul 25 2011 *)
4*Binomial[Range[50], 2] (* Harvey P. Dale, Jul 25 2011 *)

A046092(n):=2*n*(n+1)$
makelist(A046092(n),n,0,30); /* Martin Ettl, Nov 08 2012 */

a(n)=binomial(n+1,2)<<2 \\ Charles R Greathouse IV, Jun 10 2011

def A046092(n): return n*(n+1)<<1 # Chai Wah Wu, Mar 11 2025

a(n) = A100345(n+1, n-1) for n>0.
a(n) = 2*A002378(n) = 4*A000217(n). - Lekraj Beedassy, May 25 2004
a(n) = C(2n, 2) - n = 4*C(n, 2). - Zerinvary Lajos, Feb 15 2005
From Lekraj Beedassy, Jun 04 2006: (Start)
a(n) - a(n-1)=4*n.
Let k=a(n). Then a(n+1) = k + 2*(1 + sqrt(2k + 1)). (End)
Array read by rows: row n gives A033586(n), A085250(n+1). - Omar E. Pol, May 03 2008
O.g.f.:4*x/(1-x)^3; e.g.f.: exp(x)*(2*x^2+4*x). - Geoffrey Critzer, May 17 2009
From Stephen Crowley, Jul 26 2009: (Start)
a(n) = 1/int(-(x*n+x-1)*(step((-1+x*n)/n)-1)*n*step((x*n+x-1)/(n+1)),x=0..1) where step(x)=piecewise(x<0,0,0<=x,1) is the Heaviside step function.
Sum_{n>=1} 1/a(n) = 1/2. (End)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(0)=0, a(1)=4, a(2)=12. - Harvey P. Dale, Jul 25 2011
For n > 0, a(n) = 1/(Integral_{x=0..Pi/2} (sin(x))^(2*n-1)*(cos(x))^3). - Francesco Daddi, Aug 02 2011
a(n) = A001844(n) - 1. - Omar E. Pol, Oct 03 2011
(a(n) - A000217(k))^2  = A000217(2n-k)*A000217(2n+1+k) - (A002378(n) - A000217(k)), for all k. See also A001105. - Charlie Marion, May 09 2013
From Ivan N. Ianakiev, Aug 30 2013: (Start)
a(n)*(2m+1)^2 + a(m) = a(n*(2m+1)+m), for any nonnegative integers n and m.
t(k)*a(n) + t(k-1)*a(n+1) = a((n+1)*(t(k)-t(k-1)-1)), where k>=2, n>=1, t(k)=A000217(k). (End)
a(n) = A245300(n,n). - Reinhard Zumkeller, Jul 17 2014
2*a(n)+1 = A016754(n) = A005408(n)^2, the odd squares. - M. F. Hasler, Oct 02 2014
Sum_{n>=1} (-1)^(n+1)/a(n) = log(2) - 1/2 = A187832. - Ilya Gutkovskiy, Mar 16 2017
a(n) = lcm(2*n,2*n+2). - Enrique Navarrete, Aug 30 2017
a(n)*a(n+k) + k^2 = m^2 (a perfect square), n >= 1, k >= 0. - Ezhilarasu Velayutham, May 13 2019
From Amiram Eldar, Jan 29 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = cosh(Pi/2)/(Pi/2).
Product_{n>=1} (1 - 1/a(n)) = -2*cos(sqrt(3)*Pi/2)/Pi. (End)
a(n) = A016754(n) - A001844(n). - Leo Tavares, Sep 20 2022

A028347 a(n) = n^2 - 4.

Original entry on oeis.org

0, 5, 12, 21, 32, 45, 60, 77, 96, 117, 140, 165, 192, 221, 252, 285, 320, 357, 396, 437, 480, 525, 572, 621, 672, 725, 780, 837, 896, 957, 1020, 1085, 1152, 1221, 1292, 1365, 1440, 1517, 1596, 1677, 1760, 1845, 1932, 2021, 2112, 2205, 2300, 2397, 2496, 2597

Offset: 2

N. J. A. Sloane

Nonnegative X values of solutions to the equation X^3 + 4*X^2 = Y^2. The respective Y values are n*(n^2 - 4). - Mohamed Bouhamida, Nov 06 2007
Discriminants of binary forms x^2 + n*x*y + y^2 (for n > 1). - Artur Jasinski, Apr 28 2008
a(n)*a(n-1) + 4 = (a(n)-n)^2. This is the case d = 4 in the general (n^2-d)*((n-1)^2-d) + d = (n^2-n-d)^2. - Bruno Berselli, Dec 07 2011
Interleaving of A134582 and A078371. - Bruce J. Nicholson, Oct 14 2019

			G.f. = 5*x^3 + 12*x^4 + 21*x^5 + 32*x^6 + 45*x^7 + 60*x^8 + 77*x^9 + 96*x^10 + ...

Alain Connes, Noncommutative Geometry, Academic Press, 1994, p. 35.

G. C. Greubel, Table of n, a(n) for n = 2..1000
Milan Janjic and Boris Petkovic, A Counting Function, arXiv 1301.4550 [math.CO], 2013.
F. P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, March 2014; Preprint on ResearchGate.
Eric Weisstein's World of Mathematics, Near-Square Prime.
Wikipedia, Hydrogen spectral series.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

a(n), n>=3, second column (used for the Balmer series of the hydrogen atom) of triangle A120070.

Cf. A005563, A046092, A001082, A002378, A036666, A062717, A078371, A134582.

A028347:=n->n^2 - 4; seq(A028347(n), n=2..100); # Wesley Ivan Hurt, Mar 11 2014

Table[n^2 - 4, {n, 2, 100}] (* Vladimir Joseph Stephan Orlovsky, Nov 06 2008 *)
LinearRecurrence[{3,-3,1}, {0, 5, 12}, 50] (* G. C. Greubel, Nov 25 2016 *)

a(n)=n^2-4 \\ Charles R Greathouse IV, Mar 11 2014

Except for initial term, denominators of energies of hydrogen lines.
a(n+2) = n*(n+4). G.f.: x^3*(5-3*x)/(1-x)^3. - Barry E. Williams, Jun 16 2000, R. J. Mathar, Aug 06 2009
a(n) = 2*n + a(n-1) - 1. - Vincenzo Librandi, Aug 02 2010
Sum_{n >= 3} 1/a(n) = 25/48 = 0.52083333... = 100*A021196. - R. J. Mathar, Mar 22 2011
a(n) = x, the solution of k = (sqrt(x)+n)/2 and k + (1/k) = n (also valid for a(0) = -4 and a(1) = -3). - Charles L. Hohn, Apr 16 2011
E.g.f.: (x^2 + x - 4)*exp(x). - G. C. Greubel, Jul 17 2017
Sum_{n>=3} (-1)^(n+1)/a(n) = 7/48. - Amiram Eldar, Jul 03 2020
From Amiram Eldar, Feb 05 2024: (Start)
Product_{n>=3} (1 - 1/a(n)) = 6*sin(sqrt(5)*Pi)/(sqrt(5)*Pi).
Product_{n>=3} (1 + 1/a(n)) = -4*sqrt(3)*sin(sqrt(3)*Pi)/Pi. (End)

A017113 a(n) = 8*n + 4.

Original entry on oeis.org

4, 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100, 108, 116, 124, 132, 140, 148, 156, 164, 172, 180, 188, 196, 204, 212, 220, 228, 236, 244, 252, 260, 268, 276, 284, 292, 300, 308, 316, 324, 332, 340, 348, 356, 364, 372, 380, 388, 396, 404, 412, 420, 428, 436, 444, 452, 460, 468

Offset: 0

N. J. A. Sloane

Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0(65).
n such that 16 is the largest power of 2 dividing A003629(k)^n - 1 for any k. - Benoit Cloitre, Mar 23 2002
Continued fraction expansion of tanh(1/4). - Benoit Cloitre, Dec 17 2002
Consider all primitive Pythagorean triples (a,b,c) with c - a = 8, sequence gives values for b. (Corresponding values for a are A078371(n), while c follows A078370(n).) - Lambert Klasen (Lambert.Klasen(AT)gmx.net), Nov 19 2004
Also numbers of the form a^2 + b^2 + c^2 + d^2, where a,b,c,d are odd integers. - Alexander Adamchuk, Dec 01 2006
If X is an n-set and Y_i (i=1,2,3) mutually disjoint 2-subsets of X then a(n-5) is equal to the number of 4-subsets of X intersecting each Y_i (i=1,2,3). - Milan Janjic, Aug 26 2007
A007814(a(n)) = 2; A037227(a(n)) = 5. - Reinhard Zumkeller, Jun 30 2012
Numbers k such that 3^k + 1 is divisible by 41. - Bruno Berselli, Aug 22 2018
Lexicographically smallest arithmetic progression of positive integers avoiding Fibonacci numbers. - Paolo Xausa, May 08 2023
From Martin Renner, May 24 2024: (Start)
Also number of points in a grid cross with equally long arms and a width of two points, e.g.:
                                         * *
                        * *              * *
           * *          * *              * *
  * *    * * * *    * * * * * *    * * * * * * * *
  * *    * * * *    * * * * * *    * * * * * * * *
           * *          * *              * *
                        * *              * *
                                         * *
etc. (End)

Paolo Xausa, Table of n, a(n) for n = 0..10000 (terms 0..1100 from Vincenzo Librandi)
E. Catalan, Extrait d'une lettre, Bulletin de la S. M. F., tome 17 (1889), pp. 205-206. [If N is a prime number of the form 4*m+1, then 8*N+4 is the sum of four odd squares.]
Cody Clifton, Commutativity in non-Abelian Groups, May 06 2010.
Colin Defant and Noah Kravitz, Loops and Regions in Hitomezashi Patterns, arXiv:2201.03461 [math.CO], 2022. Theorem 1.2.
Dr Barker, How to Avoid the Fibonacci Numbers, YouTube video, 2023.
Meimei Gu and Rongxia Hao, 3-extra connectivity of 3-ary n-cube networks, arXiv:1309.5083 [cs.DM], Sep 19, 2013.
Milan Janjic, Two Enumerative Functions.
Tanya Khovanova, Recursive Sequences.
William A. Stein, Dimensions of the spaces S_k^{new}(Gamma_0(N)).
William A. Stein, The modular forms database.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

First differences of A016742 (even squares).
Cf. A078370, A078371, A081770 (subsequence).
Cf. A003629, A005408, A007814, A019683, A037227, A051062, A118413.
Cf. A008586, A016825.

a017113 = (+ 4) . (* 8)
a017113_list = [4, 12 ..]  -- Reinhard Zumkeller, Jul 13 2013

[8*n+4: n in [0..50]]; // Vincenzo Librandi, Apr 26 2011

LinearRecurrence[{2,-1}, {4,12}, 50] (* G. C. Greubel, Apr 26 2018 *)

a(n)=8*n+4 \\ Charles R Greathouse IV, Sep 23 2013

a(n) = A118413(n+1,3) for n > 2. - Reinhard Zumkeller, Apr 27 2006
a(n) = Sum_{k=0..4*n} (i^k+1)*(i^(4*n-k)+1), where i = sqrt(-1). - Bruno Berselli, Mar 19 2012
a(n) = 4*A005408(n). - Omar E. Pol, Apr 17 2016
E.g.f.: (8*x + 4)*exp(x). - G. C. Greubel, Apr 26 2018
G.f.: 4*(1+x)/(1-x)^2. - Wolfdieter Lang, Oct 27 2020
Sum_{n>=0} (-1)^n/a(n) = Pi/16 (A019683). - Amiram Eldar, Dec 11 2021
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=0} (1 - (-1)^n/a(n)) = sqrt(2) * sin(3*Pi/16).
Product_{n>=0} (1 + (-1)^n/a(n)) = sqrt(2) * cos(3*Pi/16). (End)
a(n) = 2*A016825(n) = A008586(2*n+1). - Elmo R. Oliveira, Apr 10 2025

A061041 Numerator of 1/16 - 1/n^2.

Original entry on oeis.org

0, 9, 5, 33, 3, 65, 21, 105, 1, 153, 45, 209, 15, 273, 77, 345, 3, 425, 117, 513, 35, 609, 165, 713, 3, 825, 221, 945, 63, 1073, 285, 1209, 5, 1353, 357, 1505, 99, 1665, 437, 1833, 15, 2009, 525, 2193, 143, 2385, 621, 2585, 21, 2793, 725

Offset: 4

N. J. A. Sloane, May 26 2001

From Brackett spectrum of hydrogen. Wavelengths in hydrogen spectrum are given by Rydberg's formula 1/wavelength = constant*(1/m^2 - 1/n^2).

J. E. Brady and G. E. Humiston, General Chemistry, 3rd. ed., Wiley; p. 78.

Reinhard Zumkeller, Table of n, a(n) for n = 4..10000
Frederick Sumner Brackett, Visible and Infra-Red Radiation of Hydrogen Astrophysical Journal, 56, No. 3 (1922) pp. 154-161.
J. J. O'Connor and E. F. Robertson, Johannes Robert Rydberg
Eric Weisstein's World of Physics, Balmer Formula
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,3,0,0,0,0,0,0,0, -6,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,-12,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0, -10,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,-3,0,0,0,0,0,0,0,1).

Cf. A061035 - A061050, A064038, A078371.

import Data.Ratio ((%), numerator)
a061041 n = numerator (1%16 - 1%n^2)  -- Reinhard Zumkeller, May 30 2012

[Numerator(1/16 -1/n^2): n in [4..60]]; // G. C. Greubel, Apr 19 2023

A061041:=n->numer(1/16 - 1/n^2); seq(A061041(n), n=4..60); # Wesley Ivan Hurt, Jan 28 2014

Numerator/@(1/16-1/Range[4,60]^2)  (* Harvey P. Dale, Mar 24 2011 *)

a(n)=numerator(1/16-1/n^2) \\ Charles R Greathouse IV, Aug 17 2011

[numerator(1/16 -1/n^2) for n in range(4,61)] # G. C. Greubel, Apr 19 2023

a(4*n+6) = A078371(n). - Paul Curtz, Oct 05 2008
a(n) = 3*a(n-8) - 6*a(n-16) + 10*a(n-24) - 12*a(n-32) + 12*a(n-40) - 10*a(n-48) + 6*a(n-56) - 3*a(n-64) + a(n-72). - Charles R Greathouse IV, Aug 17 2011
a(n) = (n^2-16) / gcd(16*n^2, n^2-16). - Franklin T. Adams-Watters, Sep 25 2011, corrected by Colin Barker, Jan 13 2014.

A077428 Minimal (positive) solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 with D(n)= A077425(n). The companion sequence is b(n)=A078355(n).

Original entry on oeis.org

3, 11, 66, 5, 27, 46, 146, 4098, 7, 51, 302, 1523, 258, 25, 4562498, 9, 83, 1000002, 29, 125619266, 402, 82, 68123, 2408706, 11, 123, 33710, 173, 12166146, 190, 578, 3723, 4354, 45371, 23550, 13, 171, 124846, 1703027, 18498, 110, 12448646853698, 786

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

Computed from Perron's table (see reference p. 108, for n = 1..28) which gives the minimal x,y values for the Diophantine eq. x^2 - x*y - ((D(n)-1)/4)*y^2= +1, resp., -1 if D(n)=A077425(n), resp, D(n)=A077425(n) and D(n) also in A077426.
The conversion from the x,y values of Perron's table to the minimal a=a(n) and b=b(n) solutions of a^2 - D(n)*b^2 =+4 is as follows. If D(n)=A077425(n) but not from A077426 (period length of continued fraction of (sqrt(D(n))+1)/2 is even) then a(n)=2*x(n)-y(n) and b(n)=y(n). E.g. D(4)=21 with Perron's (x,y)=(3,1) and (a,b)=(5,1). 1=b(4)=A078355(4). If D(n)=A077425(n) appears also in A077426 (odd period length of continued fraction of (sqrt(D(n))+1)/2) then a(n)=(2*x-y)^2+2 and b(n)=(2*x-y)*y. E.g. D(7)=37 with Perron's (x,y)=(7,2) leading to (a,b)=(146,24) with 24=b(7)=A078355(7).
The generic D(n) values are those from A078371(k-1) := (2*k+3)*(2*k-1), for k>=1, which are 5 (mod 8). For such D values the minimal solution is (a(n),b(n))=(2*k+1,1) (e.g. D(16)=77= A078371(3) with a(16)=2*4+1=9 and b(16)=A078355(16)=1).
The general solution of Pell a^2-D(n)*b^2 = +4 with generic D(n)=A077425(n)=A078371(k-1), k>=1, is a(n,m)= 2*T(m+1,(2*k+1)/2) and b(n,m)= S(m,2*k+1), m>=0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second, kind. See A053120 resp. A049310.
For non-generic D(n) (not from A078371) the general solution of a^2-D(n)*b^2 = +4 is a(n,m)= 2*T(m+1,a(n)/2) and b(n,m)= b(n)*S(m,a(n)), m>=0, with Chebyshev's polynomials and in this case b(n)>1.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

S. R. Finch, Class number theory
Steven R. Finch, Class number theory [Cached copy, with permission of the author]
Index entries for sequences related to Chebyshev polynomials.

d = Select[Range[5, 300, 4], !IntegerQ[Sqrt[#]]&]; a[n_] := Module[{a, b, r}, a /. {r = Reduce[a > 0 && b > 0 && a^2 - d[[n]]*b^2 == 4, {a, b}, Integers]; (r /. C[1] -> 0) || (r /. C[1] -> 1) // ToRules} // Select[#, IntegerQ, 1] &] // First; Table[a[n], {n, 1, 43}] (* Jean-François Alcover, Jul 30 2013 *)

More terms from Max Alekseyev, Mar 03 2010

A141530 a(n) = 4n^3 - 6n^2 + 1.

Original entry on oeis.org

1, -1, 9, 55, 161, 351, 649, 1079, 1665, 2431, 3401, 4599, 6049, 7775, 9801, 12151, 14849, 17919, 21385, 25271, 29601, 34399, 39689, 45495, 51841, 58751, 66249, 74359, 83105, 92511, 102601, 113399, 124929, 137215, 150281, 164151, 178849, 194399, 210825, 228151

Offset: 0

Paul Curtz, Aug 12 2008

G. C. Greubel, Table of n, a(n) for n = 0..500
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A046092, A141047, A141417.

See Librandi's comment in A078371.

[4*n^3 -6*n^2 +1: n in [0..50]]; // G. C. Greubel, Mar 29 2021

A141530:= n-> 4*n^3 -6*n^2 +1; seq(A141530(n), n=0..50); # G. C. Greubel, Mar 29 2021

Array[4*#^3-6*#^2+1&,50,0] (* Vladimir Joseph Stephan Orlovsky, Nov 03 2009 *)
LinearRecurrence[{4,-6,4,-1},{1,-1,9,55},50] (* Harvey P. Dale, Nov 30 2011 *)

a(n)=4*n^3-6*n^2+1 \\ Charles R Greathouse IV, Oct 07 2015

def A141530(n): return (m:=(n<<1)-1)*(n*(m-1)-1) # Chai Wah Wu, Mar 11 2024

[4*n^3 -6*n^2 +1 for n in (0..50)] # G. C. Greubel, Mar 29 2021

a(n) = (2*n-1)*(2*n^2 - 2*n - 1) = A060747(n)*A132209(n-1), n > 1. - R. J. Mathar, Feb 22 2009
G.f.: (1 - 5*x + 19*x^2 + 9*x^3)/(1-x)^4. - Jaume Oliver Lafont, Aug 30 2009
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) with a(0)=1, a(1)=-1, a(2)=9, a(3)=55. - Harvey P. Dale, Nov 30 2011
E.g.f.: (1 - 2*x + 6*x^2 + 4*x^3)*exp(x). - G. C. Greubel, Mar 29 2021

Corrected, completed and edited, following an observation from Vincenzo Librandi, by M. F. Hasler, Feb 12 2009

Further edited by N. J. A. Sloane, Feb 13 2009

A214297 a(0)=-1, a(1)=0, a(2)=-3; thereafter a(n+2) - 2*a(n+1) + a(n) has period 4: repeat -4, 8, -4, 2.

Original entry on oeis.org

-1, 0, -3, 2, 3, 6, 5, 12, 15, 20, 21, 30, 35, 42, 45, 56, 63, 72, 77, 90, 99, 110, 117, 132, 143, 156, 165, 182, 195, 210, 221, 240, 255, 272, 285, 306, 323, 342, 357, 380, 399, 420, 437, 462, 483, 506, 525, 552, 575, 600, 621, 650, 675, 702, 725, 756, 783, 812, 837, 870, 899, 930, 957, 992, 1023, 1056, 1085, 1122, 1155, 1190

Offset: 0

Paul Curtz, Jul 11 2012

Let a(n)/A000290(n) = [-1/0, 0/1, -3/4, 2/9, 3/16, 6/25, 5/36, 12/49, 15/64, 20/81, 21/100, 30/121, ...] = a(n)/b(n) (say).
Then b(n)-4*a(n)=4, 1, 16, 1 (period of length 4).
Permutation from a(n) to A061037(n): 1, 3, 2, 7, 5, 11, 4, 15, 9, 19, 6, ... = shifted A145979 + 1.
A061037(n) - a(n) = 0, 3, -3, -3, 0, -15, 3, -33, 0 -57, 15, -87, 0, -123, ...
First 3 rows:
-1 0 -3 2  3  6  5 12 15 20 21 30 35
1 -3  5 1  3 -1  7  3  5  1  9  5  7
-4 8 -4 2 -4  8 -4  2 -4  8 -4  2 -4.
Note that the terms of a(n) increase from 12. Compare to increasing terms permutation of A061037(n): -3,-1,0,2,3,5,6,12,15, .... and A129647.
c(n) =  0, -1, 0, -1, 2, 1, 2, 1, 4, 3, 4, 3, 6, 5, 6, 5, ... (cf. A134967)
d(n) = -1,  1, 1,  3, 1, 3, 3, 5, 3, 5, 5, 7, 5, 7, 7, 9, ..., hence:
a(n) = c(n+1) * d(n+1).

G. C. Greubel, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,1,-2,1).

[(2*n^2-11-9*(-1)^n+6*((-1)^((2*n+1-(-1)^n)/4)+(-1)^((2*n-1+(-1)^n)/4)))/8: n in [0..100]]; // G. C. Greubel, Sep 19 2018

A214297 := proc(n)
    option remember;
    if n <=5 then
        op(n+1,[-1,0,-3,2,3,6]) ;
    else
        2*procname(n-1)-procname(n-2)+procname(n-4)-2*procname(n-5)+procname(n-6) ;
    end if;
end proc: # R. J. Mathar, Jun 28 2013

Table[(2 n^2 - 11 - 9 (-1)^n + 6 ((-1)^((2 n + 1 - (-1)^n)/4) + (-1)^((2 n - 1 + (-1)^n)/4)))/8, {n, 0, 69}] (* or *)
CoefficientList[Series[-(1 - 2 x + 4 x^2 - 8 x^3 + 3 x^4)/((1 - x)^2*(1 - x^4)), {x, 0, 69}], x] (* Michael De Vlieger, Mar 24 2017 *)

vector(100, n, n--; (2*n^2-11-9*(-1)^n+6*((-1)^((2*n+1-(-1)^n)/4)+(-1)^((2*n-1+(-1)^n)/4)))/8) \\ G. C. Greubel, Sep 19 2018

a(k+4)  - a(k)    =  2*k + 4.
a(k+2)  - a(k-2)  =  2*k.
a(k+6)  - a(k-6)  =  6*k.
a(k+10) - a(k-10) = 10*k.
a(n) = 3*a(n-4) - 3*a(n-8) + a(n-12).
a(2*k)   = -1, -3, followed by 3, 5, 15, 21, 35, 45, ... (A142717);
a(2*k+1) = k*(k+1) (see A002378).
A198442(n) = -1,0,0,2,3,6,8,12,  minus 3 at A198442(4*n+2).
G.f. -( 1-2*x+4*x^2-8*x^3+3*x^4 )/( (1-x)^2*(1-x^4) ). - R. J. Mathar, Jul 17 2012; edited by N. J. A. Sloane, Jul 22 2012
From R. J. Mathar, Jun 28 2013: (Start)
a(4*k)   = A000466(k);
a(4*k+1) = A002943(k);
a(4*k+2) = A078371(k-1) for k>0;
a(4*k+3) = A002939(k+1). (End)
a(n) = (2*n^2-11-9*(-1)^n+6*((-1)^((2*n+1-(-1)^n)/4)+(-1)^((2*n-1+(-1)^n)/4)))/8. - Luce ETIENNE, Oct 27 2016

Edited by N. J. A. Sloane, Jul 22 2012

cp's OEIS Frontend

A144481 a(n) = A078371(n-1) mod 9.

Views

Author

Keywords

Formula

Extensions

A046092 4 times triangular numbers: a(n) = 2*n*(n+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

Maxima

PARI

Python

Formula

A028347 a(n) = n^2 - 4.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A017113 a(n) = 8*n + 4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A061041 Numerator of 1/16 - 1/n^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

SageMath

Formula

A077428 Minimal (positive) solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 with D(n)= A077425(n). The companion sequence is b(n)=A078355(n).

Views

Author

Keywords

Comments

References

Links

Programs

Mathematica

Extensions

A141530 a(n) = 4*n^3 - 6*n^2 + 1.

Views

Author

A046092 4 times triangular numbers: a(n) = 2n(n+1).

A141530 a(n) = 4n^3 - 6n^2 + 1.