A016838 -id:A016838 - cp's OEIS frontend

A016754 Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers.

1, 9, 25, 49, 81, 121, 169, 225, 289, 361, 441, 529, 625, 729, 841, 961, 1089, 1225, 1369, 1521, 1681, 1849, 2025, 2209, 2401, 2601, 2809, 3025, 3249, 3481, 3721, 3969, 4225, 4489, 4761, 5041, 5329, 5625, 5929, 6241, 6561, 6889, 7225, 7569, 7921, 8281, 8649, 9025

Offset: 0

N. J. A. Sloane

The brown rat (rattus norwegicus) breeds very quickly. It can give birth to other rats 7 times a year, starting at the age of three months. The average number of pups is 8. The present sequence gives the total number of rats, when the intervals are 12/7 of a year and a young rat starts having offspring at 24/7 of a year. - Hans Isdahl, Jan 26 2008
Numbers n such that tau(n) is odd where tau(x) denotes the Ramanujan tau function (A000594). - Benoit Cloitre, May 01 2003
If Y is a fixed 2-subset of a (2n+1)-set X then a(n-1) is the number of 3-subsets of X intersecting Y. - Milan Janjic, Oct 21 2007
Binomial transform of [1, 8, 8, 0, 0, 0, ...]; Narayana transform (A001263) of [1, 8, 0, 0, 0, ...]. - Gary W. Adamson, Dec 29 2007
All terms of this sequence are of the form 8k+1. For numbers 8k+1 which aren't squares see A138393. Numbers 8k+1 are squares iff k is a triangular number from A000217. And squares have form 4n(n+1)+1. - Artur Jasinski, Mar 27 2008
Sequence arises from reading the line from 1, in the direction 1, 25, ... and the line from 9, in the direction 9, 49, ..., in the square spiral whose vertices are the squares A000290. - Omar E. Pol, May 24 2008
Equals the triangular numbers convolved with [1, 6, 1, 0, 0, 0, ...]. - Gary W. Adamson & Alexander R. Povolotsky, May 29 2009
First differences: A008590(n) = a(n) - a(n-1) for n>0. - Reinhard Zumkeller, Nov 08 2009
Central terms of the triangle in A176271; cf. A000466, A053755. - Reinhard Zumkeller, Apr 13 2010
Odd numbers with odd abundance. Odd numbers with even abundance are in A088828. Even numbers with odd abundance are in A088827. Even numbers with even abundance are in A088829. - Jaroslav Krizek, May 07 2011
Appear as numerators in the non-simple continued fraction expansion of Pi-3: Pi-3 = K_{k>=1} (1-2*k)^2/6 = 1/(6+9/(6+25/(6+49/(6+...)))), see also the comment in A007509. - Alexander R. Povolotsky, Oct 12 2011
Ulam's spiral (SE spoke). - Robert G. Wilson v, Oct 31 2011
All terms end in 1, 5 or 9. Modulo 100, all terms are among { 1, 9, 21, 25, 29, 41, 49, 61, 69, 81, 89 }. - M. F. Hasler, Mar 19 2012
Right edge of both triangles A214604 and A214661: a(n) = A214604(n+1,n+1) = A214661(n+1,n+1). - Reinhard Zumkeller, Jul 25 2012
Also: Odd numbers which have an odd sum of divisors (= sigma = A000203). - M. F. Hasler, Feb 23 2013
Consider primitive Pythagorean triangles (a^2 + b^2 = c^2, gcd(a, b) = 1) with hypotenuse c (A020882) and respective even leg b (A231100); sequence gives values c-b, sorted with duplicates removed. - K. G. Stier, Nov 04 2013
For n>1 a(n) is twice the area of the irregular quadrilateral created by the points ((n-2)*(n-1),(n-1)*n/2), ((n-1)*n/2,n*(n+1)/2), ((n+1)*(n+2)/2,n*(n+1)/2), and ((n+2)*(n+3)/2,(n+1)*(n+2)/2). - J. M. Bergot, May 27 2014
Number of pairs (x, y) of Z^2, such that max(abs(x), abs(y)) <= n. - Michel Marcus, Nov 28 2014
Except for a(1)=4, the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 737", based on the 5-celled von Neumann neighborhood. - Robert Price, May 23 2016
a(n) is the sum of 2n+1 consecutive numbers, the first of which is n+1. - Ivan N. Ianakiev, Dec 21 2016
a(n) is the number of 2 X 2 matrices with all elements in {0..n} with determinant = 2*permanent. - Indranil Ghosh, Dec 25 2016
Engel expansion of Pi*StruveL_0(1)/2 where StruveL_0(1) is A197037. - Benedict W. J. Irwin, Jun 21 2018
Consider all Pythagorean triples (X,Y,Z=Y+1) ordered by increasing Z; the segments on the hypotenuse {p = a(n)/A001844(n), q = A060300(n)/A001844(n) = A001844(n) - p} and their ratio p/q = a(n)/A060300(n) are irreducible fractions in Q\Z. X values are A005408, Y values are A046092, Z values are A001844. - Ralf Steiner, Feb 25 2020
a(n) is the number of large or small squares that are used to tile primitive squares of type 2 (A344332). - Bernard Schott, Jun 03 2021
Also, positive odd integers with an odd number of odd divisors (for similar sequence with 'even', see A348005). - Bernard Schott, Nov 21 2021
a(n) is the least odd number k = x + y, with 0 < x < y, such that there are n distinct pairs (x,y) for which x*y/k is an integer; for example, a(2) = 25 and the two corresponding pairs are (5,20) and (10,15). The similar sequence with 'even' is A016742 (see Comment of Jan 26 2018). - Bernard Schott, Feb 24 2023
From Peter Bala, Jan 03 2024: (Start)
The sequence terms are the exponents of q in the series expansions of the following infinite products:
1) q*Product_{n >= 1} (1 - q^(16*n))*(1 + q^(8*n)) = q + q^9 + q^25 + q^49 + q^81 + q^121 + q^169 + ....
2) q*Product_{n >= 1} (1 + q^(16*n))*(1 - q^(8*n)) = q - q^9 - q^25 + q^49 + q^81 - q^121 - q^169 + + - - ....
3) q*Product_{n >= 1} (1 - q^(8*n))^3 = q - 3*q^9 + 5*q^25 - 7*q^49 + 9*q^81 - 11*q^121 + 13*q^169 - + ....
4) q*Product_{n >= 1} ( (1 + q^(8*n))*(1 - q^(16*n))/(1 + q^(16*n)) )^3 = q + 3*q^9 - 5*q^25 - 7*q^49 + 9*q^81 + 11*q^121 - 13*q^169 - 15*q^225 + + - - .... (End)

L. Lorentzen and H. Waadeland, Continued Fractions with Applications, North-Holland 1992, p. 586.

Paolo Xausa, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe).
Jeremiah Bartz, Bruce Dearden, and Joel Iiams, Classes of Gap Balancing Numbers, arXiv:1810.07895 [math.NT], 2018.
Bruce C. Berndt and Ken Ono, Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary, Séminaire Lotharingien de Combinatoire, B42c (1999), 63 pp.
John Elias, Illustration: 8-fold Square Progression of Ulam's Spiral.
Milan Janjic, Two Enumerative Functions.
Scientific American, Cover of the March 1964 issue.
Amelia Carolina Sparavigna, Groupoids of OEIS A002378 and A016754 Numbers (oblong and odd square numbers), Politecnico di Torino (Italy, 2019).
Leo Tavares, Illustration: Diamond Triangles.
Leo Tavares, Illustration: Diamond Stars.
Eric Weisstein's World of Mathematics, Moore Neighborhood.
R. Yin, J. Mu, and T. Komatsu, The p-Frobenius Number for the Triple of the Generalized Star Numbers, Preprints 2024, 2024072280. See p. 2.
Index entries for sequences related to centered polygonal numbers.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000290, A000384, A001263, A001539, A001844, A003881, A005408, A006752, A014105, A016742, A016802, A016814, A016826, A016838, A033996, A046092, A060300, A138393, A167661, A167700.
Cf. A000447 (partial sums).
Cf. A005917, A344330, A344332.
Cf. A348005, A379481 [= a(A048673(n)-1)].
Partial sums of A022144.
Positions of odd terms in A341528.
Sequences on the four axes of the square spiral: Starting at 0: A001107, A033991, A007742, A033954; starting at 1: A054552, A054556, A054567, A033951.
Sequences on the four diagonals of the square spiral: Starting at 0: A002939 = 2*A000384, A016742 = 4*A000290, A002943 = 2*A014105, A033996 = 8*A000217; starting at 1: A054554, A053755, A054569, A016754.
Sequences obtained by reading alternate terms on the X and Y axes and the two main diagonals of the square spiral: Starting at 0: A035608, A156859, A002378 = 2*A000217, A137932 = 4*A002620; starting at 1: A317186, A267682, A002061, A080335.
Cf. A014634, A003154.

a016754 n = a016754_list !! n
a016754_list = scanl (+) 1 $ tail a008590_list
-- Reinhard Zumkeller, Apr 02 2012

[n^2: n in [1..100 by 2]]; // Vincenzo Librandi, Jan 03 2017

Range[1, 100, 2]^2 (* Paolo Xausa, Feb 13 2025 *)

A016754(n):=(n+n+1)^2$
makelist(A016754(n),n,0,20); /* Martin Ettl, Nov 12 2012 */

A016754(n)=(n<<1+1)^2 \\ Charles R Greathouse IV, Jun 16 2011, corrected and edited by M. F. Hasler, Apr 11 2023

def A016754(n): return ((n<<1)|1)**2 # Chai Wah Wu, Jul 06 2023

a(n) = 1 + Sum_{i=1..n} 8*i = 1 + 8*A000217(n). - Xavier Acloque, Jan 21 2003; Zak Seidov, May 07 2006; Robert G. Wilson v, Dec 29 2010
O.g.f.: (1+6*x+x^2)/(1-x)^3. - R. J. Mathar, Jan 11 2008
a(n) = 4*n*(n + 1) + 1 = 4*n^2 + 4*n + 1. - Artur Jasinski, Mar 27 2008
a(n) = A061038(2+4n). - Paul Curtz, Oct 26 2008
Sum_{n>=0} 1/a(n) = Pi^2/8 = A111003. - Jaume Oliver Lafont, Mar 07 2009
a(n) = A000290(A005408(n)). - Reinhard Zumkeller, Nov 08 2009
a(n) = a(n-1) + 8*n with n>0, a(0)=1. - Vincenzo Librandi, Aug 01 2010
a(n) = A033951(n) + n. - Reinhard Zumkeller, May 17 2009
a(n) = A033996(n) + 1. - Omar E. Pol, Oct 03 2011
a(n) = (A005408(n))^2. - Zak Seidov, Nov 29 2011
From George F. Johnson, Sep 05 2012: (Start)
a(n+1) = a(n) + 4 + 4*sqrt(a(n)).
a(n-1) = a(n) + 4 - 4*sqrt(a(n)).
a(n+1) = 2*a(n) - a(n-1) + 8.
a(n+1) = 3*a(n) - 3*a(n-1) + a(n-2).
(a(n+1) - a(n-1))/8 = sqrt(a(n)).
a(n+1)*a(n-1) = (a(n)-4)^2.
a(n) = 2*A046092(n) + 1 = 2*A001844(n) - 1 = A046092(n) + A001844(n).
Limit_{n -> oo} a(n)/a(n-1) = 1. (End)
a(n) = binomial(2*n+2,2) + binomial(2*n+1,2). - John Molokach, Jul 12 2013
E.g.f.: (1 + 8*x + 4*x^2)*exp(x). - Ilya Gutkovskiy, May 23 2016
a(n) = A101321(8,n). - R. J. Mathar, Jul 28 2016
Product_{n>=1} A033996(n)/a(n) = Pi/4. - Daniel Suteu, Dec 25 2016
a(n) = A014105(n) + A000384(n+1). - Bruce J. Nicholson, Nov 11 2017
a(n) = A003215(n) + A002378(n). - Klaus Purath, Jun 09 2020
From Amiram Eldar, Jun 20 2020: (Start)
Sum_{n>=0} a(n)/n! = 13*e.
Sum_{n>=0} (-1)^(n+1)*a(n)/n! = 3/e. (End)
Sum_{n>=0} (-1)^n/a(n) = A006752. - Amiram Eldar, Oct 10 2020
From Amiram Eldar, Jan 28 2021: (Start)
Product_{n>=0} (1 + 1/a(n)) = cosh(Pi/2).
Product_{n>=1} (1 - 1/a(n)) = Pi/4 (A003881). (End)
From Leo Tavares, Nov 24 2021: (Start)
a(n) = A014634(n) - A002943(n). See Diamond Triangles illustration.
a(n) = A003154(n+1) - A046092(n). See Diamond Stars illustration. (End)
From Peter Bala, Mar 11 2024: (Start)
Sum_{k = 1..n+1} 1/(k*a(k)*a(k-1)) = 1/(9 - 3/(17 - 60/(33 - 315/(57 - ... - n^2*(4*n^2 - 1)/((2*n + 1)^2 + 2*2^2 ))))).
3/2 - 2*log(2) = Sum_{k >= 1} 1/(k*a(k)*a(k-1)) = 1/(9 - 3/(17 - 60/(33 - 315/(57 - ... - n^2*(4*n^2 - 1)/((2*n + 1)^2 + 2*2^2 - ... ))))).
Row 2 of A142992. (End)
From Peter Bala, Mar 26 2024: (Start)
8*a(n) = (2*n + 1)*(a(n+1) - a(n-1)).
Sum_{n >= 0} (-1)^n/(a(n)*a(n+1)) = 1/2 - Pi/8 = 1/(9 + (1*3)/(8 + (3*5)/(8 + ... + (4*n^2 - 1)/(8 + ... )))). For the continued fraction use Lorentzen and Waadeland, p. 586, equation 4.7.9 with n = 1. Cf. A057813. (End)

Additional description from Terrel Trotter, Jr., Apr 06 2002

A004767 a(n) = 4*n + 3.

Original entry on oeis.org

3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, 71, 75, 79, 83, 87, 91, 95, 99, 103, 107, 111, 115, 119, 123, 127, 131, 135, 139, 143, 147, 151, 155, 159, 163, 167, 171, 175, 179, 183, 187, 191, 195, 199, 203, 207, 211, 215, 219, 223

Offset: 0

N. J. A. Sloane

Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0(12).
Binary expansion ends 11.
These the numbers for which zeta(2*x+1) needs just 2 terms to be evaluated. - Jorge Coveiro, Dec 16 2004 [This comment needs clarification]
a(n) is the smallest k such that for every r from 0 to 2n - 1 there exist j and i, k >= j > i > 2n - 1, such that j - i == r (mod (2n - 1)), with (k, (2n - 1)) = (j,(2n - 1)) = (i, (2n - 1)) = 1. - Amarnath Murthy, Sep 24 2003
Complement of A004773. - Reinhard Zumkeller, Aug 29 2005
Any (4n+3)-dimensional manifold endowed with a mixed 3-Sasakian structure is an Einstein space with Einstein constant lambda = 4n + 2 [Theorem 3, p. 10 of Ianus et al.]. - Jonathan Vos Post, Nov 24 2008
Solutions to the equation x^(2*x) = 3*x (mod 4*x). - Farideh Firoozbakht, May 02 2010
Subsequence of A022544. - Vincenzo Librandi, Nov 20 2010
First differences of A084849. - Reinhard Zumkeller, Apr 02 2011
Numbers n such that {1, 2, 3, ..., n} is a losing position in the game of Nim. - Franklin T. Adams-Watters, Jul 16 2011
Numbers n such that there are no primes p that satisfy the relationship p XOR n = p + n. - Brad Clardy, Jul 22 2012
The XOR of all numbers from 1 to a(n) is 0. - David W. Wilson, Apr 21 2013
A089911(4*a(n)) = 4. - Reinhard Zumkeller, Jul 05 2013
First differences of A014105. - Ivan N. Ianakiev, Sep 21 2013
All triangular numbers in the sequence are congruent to {3, 7} mod 8. - Ivan N. Ianakiev, Nov 12 2013
Apart from the initial term, length of minimal path on an n-dimensional cubic lattice (n > 1) of side length 2, until a self-avoiding walk gets stuck. Construct a path connecting all 2n points orthogonally adjacent from the center, ending at the center. Starting at any point adjacent to the center, there are 2 steps to reach each of the remaining 2n - 1 points, resulting in path length 4n - 2 with a final step connecting the center, for a total path length of 4n - 1, comprising 4n points. - Matthew Lehman, Dec 10 2013
a(n-1), n >= 1, appears as first column in the triangles A238476 and A239126 related to the Collatz problem. - Wolfdieter Lang, Mar 14 2014
For the Collatz Conjecture, we identify two types of odd numbers. This sequence contains all the ascenders: where (3*a(n) + 1) / 2 is odd and greater than a(n). See A016813 for the descenders. - Jaroslav Krizek, Jul 29 2016

			G.f. = 3 + 7*x + 11*x^2 + 15*x^3 + 19*x^4 + 23*x^5 + 27*x^6 + 31*x^7 + ...

Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, page 85.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999. See Theorem 8.1 on page 240.

Ivan Panchenko, Table of n, a(n) for n = 0..200
Guo-Niu Han, Enumeration of Standard Puzzles
Guo-Niu Han, Enumeration of Standard Puzzles [Cached copy]
Stere Ianus, Mihai Visinescu and Gabriel-Eduard Vilcu, Hidden symmetries and Killing tensors on curved spaces, arXiv:0811.3478 [math-ph], 2008. - _Jonathan Vos Post_, Nov 24 2008
Tanya Khovanova, Recursive Sequences
Juan F. Pulido, José L. Ramírez, and Andrés R. Vindas-Meléndez, Generating Trees and Fibonacci Polyominoes, arXiv:2411.17812 [math.CO], 2024. See p. 8.
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N))
William A. Stein, The modular forms database
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A004773, A005408, A008545 (partial products), A008586, A014105, A016813, A016825, A017137, A017629, A022544, A084849, A181049, A238476, A239126.
Cf. A017101 and A004771 (bisection: 3 and 7 mod 8).
Cf. A016838 (square).

a004767 = (+ 3) . (* 4)
a004767_list = [3, 7 ..]  -- Reinhard Zumkeller, Oct 03 2012

[4*n+3: n in [0..50]]; // Wesley Ivan Hurt, Jul 09 2014

Maple
```
seq( 3+4*n, n=0..100 );
```

4 Range[50] - 1 (* Wesley Ivan Hurt, Jul 09 2014 *)

a(n)=4*n+3 \\ Charles R Greathouse IV, Jul 28 2015

Vec((3+x)/(1-x)^2 + O(x^200)) \\ Altug Alkan, Jan 15 2016

for n in range(0,50): print(4*n+3, end=', ') # Stefano Spezia, Dec 12 2018

[4*n+3 for n in range(50)] # G. C. Greubel, Dec 09 2018

(0 to 59).map(4 *  + 3) // _Alonso del Arte, Dec 12 2018

G.f.: (3+x)/(1-x)^2. - Paul Barry, Feb 27 2003
a(n) = 2*a(n-1) - a(n-2) for n > 1, a(0) = 3, a(1) = 7. - Philippe Deléham, Nov 03 2008
a(n) = A017137(n)/2. - Reinhard Zumkeller, Jul 13 2010
a(n) = 8*n - a(n-1) + 2 for n > 0, a(0) = 3. - Vincenzo Librandi, Nov 20 2010
a(n) = A005408(A005408(n)). - Reinhard Zumkeller, Jun 27 2011
a(n) = 3 + A008586(n). - Omar E. Pol, Jul 27 2012
a(n) = A014105(n+1) - A014105(n). - Michel Marcus, Sep 21 2013
a(n) = A016813(n) + 2. - Jean-Bernard François, Sep 27 2013
a(n) = 4*n - 1, with offset 1. - Wesley Ivan Hurt, Mar 12 2014
From Ilya Gutkovskiy, Jul 29 2016: (Start)
E.g.f.: (3 + 4*x)*exp(x).
Sum_{n >= 0} (-1)^n/a(n) = (Pi + 2*log(sqrt(2) - 1))/(4*sqrt(2)) = A181049. (End)

A016742 Even squares: a(n) = (2*n)^2.

Original entry on oeis.org

0, 4, 16, 36, 64, 100, 144, 196, 256, 324, 400, 484, 576, 676, 784, 900, 1024, 1156, 1296, 1444, 1600, 1764, 1936, 2116, 2304, 2500, 2704, 2916, 3136, 3364, 3600, 3844, 4096, 4356, 4624, 4900, 5184, 5476, 5776, 6084, 6400, 6724, 7056, 7396, 7744, 8100, 8464

Offset: 0

N. J. A. Sloane

4 times the squares.
Number of edges in the complete bipartite graph of order 5n, K_{n,4n} - Roberto E. Martinez II, Jan 07 2002
It is conjectured (I think) that a regular Hadamard matrix of order n exists iff n is an even square (cf. Seberry and Yamada, Th. 10.11). A Hadamard matrix is regular if the sum of the entries in each row is the same. - N. J. A. Sloane, Nov 13 2008
Sequence arises from reading the line from 0, in the direction 0, 16, ... and the line from 4, in the direction 4, 36, ... in the square spiral whose vertices are the squares A000290. - Omar E. Pol, May 24 2008
The entries from a(1) on can be interpreted as pair sums of (2, 2), (8, 8), (18, 18), (32, 32) etc. that arise from a re-arrangement of the subshell orbitals in the periodic table of elements. 8 becomes the maximum number of electrons in the (2s,2p) or (3s,3p) orbitals, 18 the maximum number of electrons in (4s,3d,4p) or (5s,3d,5p) shells, for example. - Julio Antonio Gutiérrez Samanez, Jul 20 2008
The first two terms of the sequence (n=1, 2) give the numbers of chemical elements using only n types of atomic orbitals, i.e., there are a(1)=4 elements (H,He,Li,Be) where electrons reside only on s-orbitals, there are a(2)=16 elements (B,C,N,O,F,Ne,Na,Mg,Al,Si,P,S,Cl,Ar,K,Ca) where electrons reside only on s- and p-orbitals. However, after that, there is 37 (which is one more than a(3)=36) elements (from Sc, Scandium, atomic number 21 to La, Lanthanum, atomic number 57) where electrons reside only on s-, p- and d-orbitals. This is because Lanthanum (with the electron configuration [Xe]5d^1 6s^2) is an exception to the Aufbau principle, which would predict that its electron configuration is [Xe]4f^1 6s^2. - Antti Karttunen, Aug 14 2008.
Number of cycles of length 3 in the king's graph associated with an (n+1) X (n+1) chessboard. - Anton Voropaev (anton.n.voropaev(AT)gmail.com), Feb 01 2009
a(n+1) is the molecular topological index of the n-star graph S_n. - Eric W. Weisstein, Jul 11 2011
a(n) is the sum of two consecutives odd numbers 2*n^2-1 and 2*n^2+1 and the difference of two squares (n^2+1)^2 - (n^2-1)^2. - Pierre CAMI, Jan 02 2012
For n > 3, a(n) is the area of the irregular quadrilateral created by the points ((n-4)*(n-3)/2,(n-3)*(n-2)/2), ((n-2)*(n-1)/2,(n-1)*n/2), ((n+1)*(n+2)/2,n*(n+1)/2), and ((n+3)*(n+4)/2,(n+2)*(n+3)/2). - J. M. Bergot, May 27 2014
Number of terms less than 10^k: 1, 2, 5, 16, 50, 159, 500, 1582, 5000, 15812, 50000, 158114, 500000, ... - Muniru A Asiru, Jan 28 2018
Right-hand side of the binomial coefficient identity Sum_{k = 0..2*n} (-1)^(k+1)* binomial(2*n,k)*binomial(2*n + k,k)*(2*n - k) = a(n). - Peter Bala, Jan 12 2022

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.
Seberry, Jennifer and Yamada, Mieko; Hadamard matrices, sequences and block designs, in Dinitz and Stinson, eds., Contemporary design theory, pp. 431-560, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, New York, 1992.
W. D. Wallis, Anne Penfold Street and Jennifer Seberry Wallis, Combinatorics: Room squares, sum-free sets, Hadamard matrices, Lecture Notes in Mathematics, Vol. 292, Springer-Verlag, Berlin-New York, 1972. iv+508 pp.

Vincenzo Librandi, Table of n, a(n) for n = 0..900
R. P. Boas and N. J. A. Sloane, Correspondence, 1974.
Leo Tavares, Illustration: X Squares
Various, Electron Configuration (Discussion in Physics Forums).
Eric Weisstein's World of Mathematics, Graph Cycle.
Eric Weisstein's World of Mathematics, King Graph.
Eric Weisstein's World of Mathematics, Molecular Topological Index.
Wikipedia, Aufbau principle.
Index entries for sequences related to Hadamard matrices
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000290, A001105, A001539, A016754, A016802, A016814, A016826, A016838, A007742, A033991, A245058.
Sequences on the four axes of the square spiral: Starting at 0: A001107, A033991, A007742, A033954; starting at 1: A054552, A054556, A054567, A033951.
Sequences on the four diagonals of the square spiral: Starting at 0: A002939 = 2*A000384, A016742 = 4*A000290, A002943 = 2*A014105, A033996 = 8*A000217; starting at 1: A054554, A053755, A054569, A016754.
Sequences obtained by reading alternate terms on the X and Y axes and the two main diagonals of the square spiral: Starting at 0: A035608, A156859, A002378 = 2*A000217, A137932 = 4*A002620; starting at 1: A317186, A267682, A002061, A080335.
Cf. sequences listed in A254963.
Other n X n king graph cycle counts: A288918 (4-cycles), A288919 (5-cycles), A288920 (6-cycles).
Cf. A000384, A014105.
Cf. A016813.

List([0..100], n -> (2*n)^2); # Muniru A Asiru, Jan 28 2018

a016742 = (* 4) . (^ 2)
a016742_list = 0 : map (subtract 4) (zipWith (+) a016742_list [8, 16 ..])
-- Reinhard Zumkeller, Jun 28 2015, Apr 20 2015

[(2*n)^2: n in [0..50]]; // Vincenzo Librandi, Apr 26 2011

seq((2*n)^2, n=0..100); # Muniru A Asiru, Jan 28 2018

Table[(2n)^2, {n, 0, 46}] (* Alonso del Arte, Apr 26 2011 *)

makelist((2*n)^2,n,0,20); /* Martin Ettl, Jan 22 2013 */

a(n)=4*n^2 \\ Charles R Greathouse IV, Jul 28 2015

O.g.f.: 4*x*(1+x)/(1-x)^3. - R. J. Mathar, Jul 28 2008
a(n) = A000290(n)*4 = A001105(n)*2. - Omar E. Pol, May 21 2008
a(n) = A155955(n,2) for n > 1. - Reinhard Zumkeller, Jan 31 2009
Sum_{n>=1} 1/a(n) = (1/4)*Pi^2/6 = Pi^2/24. - Ant King, Nov 04 2009
a(n) = a(n-1) + 8*n - 4 (with a(0)=0). - Vincenzo Librandi, Nov 19 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) with a(0) = 0, a(1) = 4, a(2) = 16. - Philippe Deléham, Mar 26 2013
a(n) = A118729(8n+3). - Philippe Deléham, Mar 26 2013
Pi = 2*Product_{n>=1} (1 + 1/(a(n)-1)). - Adriano Caroli, Aug 04 2013
Pi = Sum_{n>=0} 8/(a(2n+1)-1). - Adriano Caroli, Aug 06 2013
E.g.f.: exp(x)*(4x^2 + 4x). - Geoffrey Critzer, Oct 07 2013
a(n) = A000384(n) + A014105(n). - Bruce J. Nicholson, Nov 11 2017
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/48 (A245058). - Amiram Eldar, Oct 10 2020
From Amiram Eldar, Jan 25 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = sinh(Pi/2)/(Pi/2) (A308716).
Product_{n>=1} (1 - 1/a(n)) = sin(Pi/2)/(Pi/2) = 2/Pi (A060294). (End)
a(n) = A016754(n) - A016813(n). - Leo Tavares, Feb 24 2022

More terms from Sabir Abdus-Samee (sabdulsamee(AT)prepaidlegal.com), Mar 13 2006

A016814 a(n) = (4*n + 1)^2.

Original entry on oeis.org

1, 25, 81, 169, 289, 441, 625, 841, 1089, 1369, 1681, 2025, 2401, 2809, 3249, 3721, 4225, 4761, 5329, 5929, 6561, 7225, 7921, 8649, 9409, 10201, 11025, 11881, 12769, 13689, 14641, 15625, 16641, 17689, 18769, 19881, 21025, 22201, 23409, 24649, 25921, 27225, 28561, 29929

Offset: 0

N. J. A. Sloane

A bisection of A016754. Sequence arises from reading the line from 1, in the direction 1, 25, ..., in the square spiral whose vertices are the squares A000290. - Omar E. Pol, May 24 2008

G. C. Greubel, Table of n, a(n) for n = 0..10000 (terms 0..200 from Ivan Panchenko).
Leo Tavares, Illustration: Square trapeziums
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Sequences of the form (m*n+1)^2: A000012 (m=0), A000290 (m=1), A016754 (m=2), A016778 (m-3), this sequence (m=4), A016862 (m=5), A016922 (m=6), A016994 (m=7), A017078 (m=8), A017174 (m=9), A017282 (m=10), A017402 (m=11), A017534 (m=12), A134934 (m=14).
Cf. A001539, A006752, A016742, A016802, A016813.
Cf. A016826, A016838, A017126, A068467, A087197.
Cf. A272399, A014105.

[(4*n+1)^2: n in [0..40]]; // G. C. Greubel, Dec 28 2022

A016814:=n->(4*n+1)^2; seq(A016814(k), k=0..100); # Wesley Ivan Hurt, Nov 02 2013

(4*Range[0,40] +1)^2 (* or *) LinearRecurrence[{3,-3,1}, {1,25,81}, 40] (* Harvey P. Dale, Nov 20 2012 *)
Accumulate[32Range[0, 47] - 8] + 9 (* Alonso del Arte, Aug 19 2017 *)

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

[(4*n+1)^2 for n in range(41)] # G. C. Greubel, Dec 28 2022

a(n) = a(n-1) + 32*n - 8, n > 0. - Vincenzo Librandi, Dec 15 2010
From George F. Johnson, Sep 28 2012: (Start)
G.f.: (1 + 22*x + 9*x^2)/(1 - x)^3.
a(n+1) = a(n) + 16 + 8*sqrt(a(n)).
a(n+1) = 2*a(n) - a(n-1) + 32 = 3*a(n) - 3*a(n-1) + a(n-2).
a(n-1)*a(n+1) = (a(n) - 16)^2 ; a(n+1) - a(n-1) = 16*sqrt(a(n)).
a(n) = A016754(2*n) = (A016813(n))^2. (End)
Sum_{n>=0} 1/a(n) = G/2 + Pi^2/16, where G is the Catalan constant (A006752). - Amiram Eldar, Jun 28 2020
Product_{n>=1} (1 - 1/a(n)) = 2*Gamma(5/4)^2/sqrt(Pi) = 2 * A068467^2 * A087197. - Amiram Eldar, Feb 01 2021
From G. C. Greubel, Dec 28 2022: (Start)
a(2*n) = A017078(n).
a(2*n+1) = A017126(n).
E.g.f.: (1 + 24*x + 16*x^2)*exp(x). (End)
a(n) = A272399(n+1) - A014105(n). - Leo Tavares, Dec 24 2023

A016802 a(n) = (4*n)^2.

Original entry on oeis.org

0, 16, 64, 144, 256, 400, 576, 784, 1024, 1296, 1600, 1936, 2304, 2704, 3136, 3600, 4096, 4624, 5184, 5776, 6400, 7056, 7744, 8464, 9216, 10000, 10816, 11664, 12544, 13456, 14400, 15376, 16384, 17424, 18496, 19600, 20736, 21904, 23104, 24336, 25600, 26896, 28224

Offset: 0

N. J. A. Sloane

A bisection of A016742. Sequence arises from reading the line from 0, in the direction 0, 16, ... in the square spiral whose vertices are the squares A000290. - Omar E. Pol, May 24 2008

Also, sequence found by reading the line from 0, in the direction 0, 16, ... in the square spiral whose vertices are the generalized decagonal numbers A074377. - Omar E. Pol, Sep 10 2011

Karl-Heinz Hofmann, Table of n, a(n) for n = 0..10000 (first 200 terms from Ivan Panchenko).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000290, A001105, A001539, A016742, A016754, A016814, A016826, A016838, A112628.

Cf. A008598, A074377, A139098, A195146.

a(n) = (4*n)^2; \\ Michel Marcus, Mar 04 2014

def A016802(n): return (4*n)**2 # Karl-Heinz Hofmann, Sep 11 2024

a(n) = 16*n^2 = 16*A000290(n). - Omar E. Pol, Dec 11 2008
a(n) = 8*A001105(n) = 4*A016742(n) = 2*A139098(n). - Omar E. Pol, Dec 13 2008
a(n) = a(n-1) + 16*(2*n-1) (with a(0)=0). - Vincenzo Librandi, Nov 20 2010
From Amiram Eldar, Jan 25 2021: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/96.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/192.
Product_{n>=1} (1 + 1/a(n)) = sinh(Pi/4)/(Pi/4).
Product_{n>=1} (1 - 1/a(n)) = sin(Pi/4)/(Pi/4) = 2*sqrt(2)/Pi (A112628). (End)
From Elmo R. Oliveira, Nov 30 2024: (Start)
G.f.: 16*x*(1 + x)/(1-x)^3.
E.g.f.: 16*x*(1 + x)*exp(x).
a(n) = n*A008598(n) = A195146(2*n).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A130861 a(n) = (n-1)(2n+5).

Original entry on oeis.org

0, 9, 22, 39, 60, 85, 114, 147, 184, 225, 270, 319, 372, 429, 490, 555, 624, 697, 774, 855, 940, 1029, 1122, 1219, 1320, 1425, 1534, 1647, 1764, 1885, 2010, 2139, 2272, 2409, 2550, 2695, 2844, 2997, 3154, 3315, 3480, 3649, 3822, 3999, 4180, 4365

Offset: 1

Roger L. Bagula, Jul 22 2007

Old name was: "Ratio of Sum of k^2-1 to sum of k made into an integer sequence: (n-1)*(2*n+5)".

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

Cf. A016838.

Table[(n-1)(2n+5),{n,50}] (* or *) LinearRecurrence[{3,-3,1},{0,9,22},50] (* Harvey P. Dale, Oct 02 2015 *)

a(n)=(n-1)*(2*n+5) \\ Charles R Greathouse IV, Sep 24 2015

a(n) = 3*(n + 1)*( Sum_{k=1..n} k^2-1 )/ ( Sum_{k=1..n} k ) = (-1 + n)*(5 + 2*n).
G.f.: x^2*(9 - 5*x)/(1-x)^3. - R. J. Mathar, Nov 14 2007
a(n) = a(n-1) +4*n +1 for n>1, a(1)=0. - Vincenzo Librandi, Nov 23 2010
a(n) = n*(2n+7) with offset 0. - Michel Marcus, Jan 28 2015
8*a(n) + 49 = A016838(n). - Bruno Berselli, Jan 28 2015
E.g.f.: 5 + (2*x^2 + 5* x -5)*exp(x). - G. C. Greubel, Jul 21 2017

A016826 a(n) = (4n + 2)^2.

Original entry on oeis.org

4, 36, 100, 196, 324, 484, 676, 900, 1156, 1444, 1764, 2116, 2500, 2916, 3364, 3844, 4356, 4900, 5476, 6084, 6724, 7396, 8100, 8836, 9604, 10404, 11236, 12100, 12996, 13924, 14884, 15876, 16900, 17956

Offset: 0

N. J. A. Sloane

A bisection of A016742. Sequence arises from reading the line from 4, in the direction 4, 36, ... in the square spiral whose vertices are the squares A000290. - Omar E. Pol, May 24 2008

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Equals A001539 + 1.

Cf. A000290, A010503, A016742, A016754, A016802, A016814, A016838.

A016826:=n->(4*n + 2)^2; seq(A016826(n), n=0..40); # Wesley Ivan Hurt, Feb 24 2014

(4*Range[0,40]+2)^2 (* or *) LinearRecurrence[{3,-3,1},{4,36,100},40] (* Harvey P. Dale, Nov 24 2011 *)

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

a(n) = a(n-1) + 32*n (with a(0)=4). - Vincenzo Librandi, Dec 15 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3), with a(0)=4, a(1)=36, a(2)=100. - Harvey P. Dale, Nov 24 2011
G.f.: -((4*(x^2+6*x+1))/(x-1)^3). - Harvey P. Dale, Nov 24 2011
a(n) = A000290(A016825(n)). - Wesley Ivan Hurt, Feb 24 2014
From Amiram Eldar, Jun 28 2020: (Start)
Sum_{n>=0} 1/a(n) = Pi^2/32.
Sum_{n>=0} (-1)^n/a(n) = G/4, where G is the Catalan constant (A006752). (End)
From Amiram Eldar, Jan 29 2021: (Start)
Product_{n>=0} (1 + 1/a(n)) = cosh(Pi/4).
Product_{n>=0} (1 - 1/a(n)) = 1/sqrt(2) (A010503). (End)

A017138 a(n) = (8*n+6)^2.

Original entry on oeis.org

36, 196, 484, 900, 1444, 2116, 2916, 3844, 4900, 6084, 7396, 8836, 10404, 12100, 13924, 15876, 17956, 20164, 22500, 24964, 27556, 30276, 33124, 36100, 39204, 42436, 45796, 49284, 52900, 56644, 60516, 64516, 68644, 72900, 77284, 81796, 86436, 91204, 96100, 101124

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A006752, A016838, A017137.

[(8*n+6)^2: n in [0..35]]; // Vincenzo Librandi, Jul 22 2011

Table[(8*n + 6)^2, {n, 0, 30}] (* Amiram Eldar, Apr 26 2023 *)

a(n)=(8*n+6)^2 \\ Charles R Greathouse IV, Jun 17 2017

G.f.: ( -36-88*x-4*x^2 ) / (x-1)^3. - R. J. Mathar, Aug 26 2015
From Amiram Eldar, Apr 26 2023: (Start)
a(n) = A017137(n)^2.
a(n) = 2^2*A016838(n).
Sum_{n>=0} 1/a(n) = Pi^2/64 - G/8, where G is Catalan's constant (A006752). (End)
E.g.f.: 4*exp(x)*(9 + 40*x + 16*x^2). - Stefano Spezia, Sep 02 2025

A016848 a(n) = (4*n+3)^12.

Original entry on oeis.org

531441, 13841287201, 3138428376721, 129746337890625, 2213314919066161, 21914624432020321, 150094635296999121, 787662783788549761, 3379220508056640625, 12381557655576425121, 39959630797262576401

Offset: 0

N. J. A. Sloane

David A. Corneth, Table of n, a(n) for n = 0..9999
Index entries for linear recurrences with constant coefficients, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).

Cf. A008456.

Cf. A004767, A016838, A016839, A016840, A016841, A016842, A016843, A016844, A016845, A016846, A016847.

List([0..12], n-> (4*n+3)^12); # G. C. Greubel, Aug 29 2019

[(4*n+3)^12: n in [0..12]]; // G. C. Greubel, Aug 29 2019

seq((4*n+3)^12, n=0..12); # G. C. Greubel, Aug 29 2019

(4*Range[13]-1)^12 (* G. C. Greubel, Aug 29 2019 *)

a(n) = (4*n+3)^12 \\ David A. Corneth, Aug 28 2019

[(4*n+3)^12 for n in (0..12)] # G. C. Greubel, Aug 29 2019

A241747 Triangle read by rows: T(n,k) = (4n+3)(4*k+3).

Original entry on oeis.org

9, 21, 49, 33, 77, 121, 45, 105, 165, 225, 57, 133, 209, 285, 361, 69, 161, 253, 345, 437, 529, 81, 189, 297, 405, 513, 621, 729, 93, 217, 341, 465, 589, 713, 837, 961, 105, 245, 385, 525, 665, 805, 945, 1085, 1225, 117, 273, 429, 585, 741, 897, 1053, 1209, 1365, 1521

Offset: 0

Vincenzo Librandi, Apr 29 2014

A016838(n) first diagonal.
A085027(n) second diagonal.
A017629(n) column k=0.
Row sums give the second bisection of A002414: 9, 70, 231, 540, 1045, 1794, 2835, 4216, ... [Bruno Berselli, May 08 2014]

			Triangle begins:
n\k |   0     1     2    3    4    5     6     7     8     9
----|--------------------------------------------------------
0   |   9;
1   |  21,   49;
2   |  33,   77,  121;
3   |  45,  105,  165, 225;
4   |  57,  133,  209, 285, 361;
5   |  69,  161,  253, 345, 437, 529;
6   |  81,  189,  297, 405, 513, 621,  729;
7   |  93,  217,  341, 465, 589, 713,  837,  961;
8   | 105,  245,  385, 525, 665, 805,  945, 1085, 1225;
9   | 117,  273,  429, 585, 741, 897, 1053, 1209, 1365, 1521;
.....

Vincenzo Librandi, Rows n = 0..100, flattened

Cf. A002145, A004767, A016838, A017629, A085027.

[(4*n+3)*(4*k+3): k in [0..n], n in [0..15]]; /* or, as triangle: */ [[(4*n+3)*(4*k+3): k in [0..n]]: n in [0..10]];

t[n_, k_] := (4 n + 3) (4 k + 3); Table[t[n, k], {n, 0, 10}, {k, n}] // Flatten

Edited by Alois P. Heinz and Bruno Berselli, May 08 2014

cp's OEIS Frontend

A016754 Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

Maxima

PARI

Python

Formula

Extensions

A004767 a(n) = 4*n + 3.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Sage

Scala

Formula

A016742 Even squares: a(n) = (2*n)^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Formula

Extensions

A016814 a(n) = (4*n + 1)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

A016802 a(n) = (4*n)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Python

A130861 a(n) = (n-1)(2n+5).

A241747 Triangle read by rows: T(n,k) = (4n+3)(4*k+3).