A002943 -id:A002943 - cp's OEIS frontend

A002939 a(n) = 2n(2*n-1).

0, 2, 12, 30, 56, 90, 132, 182, 240, 306, 380, 462, 552, 650, 756, 870, 992, 1122, 1260, 1406, 1560, 1722, 1892, 2070, 2256, 2450, 2652, 2862, 3080, 3306, 3540, 3782, 4032, 4290, 4556, 4830, 5112, 5402, 5700, 6006, 6320, 6642, 6972, 7310, 7656, 8010, 8372

Offset: 0

N. J. A. Sloane

Write 0,1,2,... in a spiral; sequence gives numbers on one of 4 diagonals (see Example section).
For n>1 this is the Engel expansion of cosh(1), A118239. - Benoit Cloitre, Mar 03 2002
a(n) = A125199(n,n) for n>0. - Reinhard Zumkeller, Nov 24 2006
Central terms of the triangle in A195437: a(n+1) = A195437(2*n,n). - Reinhard Zumkeller, Nov 23 2011
For n>2, the terms represent the sums of those primitive Pythagorean triples with hypotenuse (H) one unit longer than the longest side (L), or H = L + 1. - Richard R. Forberg, Jun 09 2015
For n>1, a(n) is the perimeter of a Pythagorean triangle with an odd leg 2*n-1. - Agola Kisira Odero, Apr 26 2016
From Rigoberto Florez, Nov 07 2020 : (Start)
A338109(n)/a(n+1) is the Kirchhoff index of the join of the disjoint union of two complete graphs on n vertices with the empty graph on n+1 vertices.
Equivalently, the graph can be described as the graph on 3*n + 1 vertices with labels 0..3*n and with i and j adjacent iff iff  i+j> 0 mod 3.
A338588(n)/a(n+1) is the Kirchhoff index of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.
Equivalently, the graph can be described as the graph on 3*n + 2 vertices with labels 0..3*n+1 and with i and j adjacent iff  i+j> 0 mod 3.
These graphs are cographs. (End)
a(n), n>=1, is the number of paths of minimum length (length=2) from the origin to the cross polytope of size 2 in Z^n (column 2 in A371064). - Shel Kaphan, Mar 09 2024

			G.f. = 2*x + 12*x^2 + 30*x^3 + 56*x^4 + 90*x^5 + 132*x^6 + 182*x^7 + 240*x^8 + ...
On a square lattice, place the nonnegative integers at lattice points forming a spiral as follows: place "0" at the origin; then move one step in any of the four cardinal directions and place "1" at the lattice point reached; then turn 90 degrees in either direction and place a "2" at the next lattice point; then make another 90-degree turn in the same direction and place a "3" at the lattice point; etc. The terms of the sequence will lie along one of the diagonals, as seen in the example below:
.
   99  64--65--66--67--68--69--70--71--72
    |   |                               |
   98  63  36--37--38--39--40--41--42  73
    |   |   |                       |   |
   97  62  35  16--17--18--19--20  43  74
    |   |   |   |               |   |   |
   96  61  34  15   4---5---6  21  44  75
    |   |   |   |   |       |   |   |   |
   95  60  33  14   3  *0*  7  22  45  76
    |   |   |   |   |   |   |   |   |   |
   94  59  32  13  *2*--1   8  23  46  77
    |   |   |   |           |   |   |   |
   93  58  31 *12*-11--10---9  24  47  78
    |   |   |                   |   |   |
   92  57 *30*-29--28--27--26--25  48  79
    |   |                           |   |
   91 *56*-55--54--53--52--51--50--49  80
    |                                   |
  *90*-89--88--87--86--85--84--83--82--81
.
[Edited by _Jon E. Schoenfield_, Jan 01 2017]

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
H-Y. Ching, R. Florez, and A. Mukherjee, Families of Integral Cographs within a Triangular Arrays, arXiv:2009.02770 [math.CO], 2020.
A. M. Nemirovsky et al., Marriage of exact enumeration and 1/d expansion methods: lattice model of dilute polymers, J. Statist. Phys., 67 (1992), 1083-1108.
R. Tijdeman, Some applications of Diophantine approximation, pp. 261-284 of Surveys in Number Theory (Urbana, May 21, 2000), ed. M. A. Bennett et al., Peters, 2003.
Eric Weisstein's World of Mathematics, Kirchhoff Index
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Sequences from spirals: A001107, A002939, A007742, A033951-A033953, A033954, A033989-A033991, A002943, A033996, A033988.
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. A016789, A017041, A017485, A125202.
Cf. numbers of the form n*(n*k-k+4)/2 listed in A226488 (this sequence is the case k=8). - Bruno Berselli, Jun 10 2013
Cf. A017089 (first differences), A268684 (partial sums), A010050 (partial products).
Cf. A371064.

a002939 n = (* 2) . a000384
a002939_list = scanl1 (+) a017089_list
-- Reinhard Zumkeller, Jun 08 2015

[2*n*(2*n-1): n in [0..50]]; // Vincenzo Librandi, Jul 26 2011

A002939:=n->2*n*(2*n-1): seq(A002939(n), n=0..100); # Wesley Ivan Hurt, Jan 28 2017

Table[2*n*(2*n-1), {n, 0, 50}] (* Vladimir Joseph Stephan Orlovsky, Oct 25 2008 *)
2#(2#-1)&/@Range[0,50]  (* Harvey P. Dale, Mar 06 2011 *)

a(n)=2*binomial(2*n,2) \\ Charles R Greathouse IV, Jul 25 2011

a=lambda n: 2*n*(2*n-1) # Indranil Ghosh, Jan 01 2017

Sum_{n >= 1} 1/a(n) = log(2) (cf. Tijdeman).
Log(2) = Sum_{n >= 1} ((1 - 1/2) + (1/3 - 1/4) + (1/5 - 1/6) + (1/7 - 1/8) + ...) = Sum_{n >= 0} (-1)^n/(n+1). Log(2) = Integral_{x=0..1} 1/(1+x) dx. - Gary W. Adamson, Jun 22 2003
a(n) = A000384(n)*2. - Omar E. Pol, May 14 2008
From R. J. Mathar, Apr 23 2009: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: 2*x*(1+3*x)/(1-x)^3. (End)
a(n) = a(n-1) + 8*n - 6 (with a(0)=0). - Vincenzo Librandi, Nov 12 2010
a(n) = A118729(8n+1). - Philippe Deléham, Mar 26 2013
Product_{k=1..n} a(k) = (2n)! = A010050(n). - Tony Foster III, Sep 06 2015
E.g.f.: 2*x*(1 + 2*x)*exp(x). - Ilya Gutkovskiy, Apr 29 2016
a(n) = A002943(-n) for all n in Z. - Michael Somos, Jan 28 2017
0 = 12 + a(n)*(-8 + a(n) - 2*a(n+1)) + a(n+1)*(-8 + a(n+1)) for all n in Z. - Michael Somos, Jan 28 2017
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/4 - log(2)/2. - Amiram Eldar, Jul 31 2020

A007494 Numbers that are congruent to 0 or 2 mod 3.

Original entry on oeis.org

0, 2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 17, 18, 20, 21, 23, 24, 26, 27, 29, 30, 32, 33, 35, 36, 38, 39, 41, 42, 44, 45, 47, 48, 50, 51, 53, 54, 56, 57, 59, 60, 62, 63, 65, 66, 68, 69, 71, 72, 74, 75, 77, 78, 80, 81, 83, 84, 86, 87, 89, 90, 92, 93, 95, 96, 98, 99, 101, 102, 104, 105, 107

Offset: 0

Christopher Lam Cham Kee (Topher(AT)CyberDude.Com)

The map n -> a(n) (where a(n) = 3n/2 if n even or (3n+1)/2 if n odd) was studied by Mahler, in connection with "Z-numbers" and later by Flatto. One question was whether, iterating from an initial integer, one eventually encountered an iterate = 1 (mod 4). - Jeff Lagarias, Sep 23 2002
Partial sums of 0,2,1,2,1,2,1,2,1,... . - Paul Barry, Aug 18 2007
a(n) = numbers k such that antiharmonic mean of the first k positive integers is not integer. A169609(a(n-1)) = 3. See A146535 and A169609. Complement of A016777. - Jaroslav Krizek, May 28 2010
Range of A173732. - Reinhard Zumkeller, Apr 29 2012
Number of partitions of 6n into two odd parts. - Wesley Ivan Hurt, Nov 15 2014
Numbers m such that 3 divides A000217(m). - Bruno Berselli, Aug 04 2017
Maximal length of a snake like polyomino that fits in a 2 X n rectangle. - Alain Goupil, Feb 12 2020

L. Flatto, Z-numbers and beta-transformations, in Symbolic dynamics and its applications (New Haven, CT, 1991), 181-201, Contemp. Math., 135, Amer. Math. Soc., Providence, RI, 1992.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1002.
Attila Máder, The Use of Experimental Mathematics in the Classroom, in Interesting Mathematical Problems in Sciences and Everyday Life - 2011.
Kurt Mahler, An unsolved problem on the powers of 3/2, J. Austral. Math. Soc., Vol. 8 (1968), pp. 313-321.
P. Sabinin and M. G. Stone, Transforming n-gons by Folding the Plane, Amer. Math. Monthly, Vol. 102, No. 7 (1995), pp. 620-627.
Eric Weisstein's World of Mathematics, Folding.
Robert G. Wilson v, Notes with attachment.
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A000217, A001651, A032766, A035361, A063574, A132462.
Complement of A016777.
Range of A002517.
Cf. A274406. [Bruno Berselli, Jun 26 2016]

a007494 =  flip div 2 . (+ 1) . (* 3) -- Reinhard Zumkeller, Dec 12 2014

[(6*n+1)/4-(-1)^n/4: n in [0..80]]; // Vincenzo Librandi, Aug 20 2011

a[0]:=0:a[1]:=2:for n from 2 to 100 do a[n]:=a[n-2]+3 od: seq(a[n], n=0..71); # Zerinvary Lajos, Mar 16 2008
A007494:=n->floor((3*n+1)/2); seq(A007494(k), k=0..100); # Wesley Ivan Hurt, Sep 27 2013

Flatten[{#,#+2}&/@(3Range[0,40])] (* Harvey P. Dale, May 15 2011 *)
Table[2n - Floor[n/2], {n,0,100}] (* Wesley Ivan Hurt, Sep 27 2013 *)

a(n)=n+(n+1)>>1 \\ Charles R Greathouse IV, Jul 25 2011

a(n) = 3*n/2 if n even, otherwise (3*n+1)/2.
If u(1)=0, u(n) = n + floor(u(n-1)/3), then a(n-1) = u(n). - Benoit Cloitre, Nov 26 2002
G.f.: x*(x+2)/((1-x)^2*(1+x)). - Ralf Stephan, Apr 13 2002
a(n) = 3*floor(n/2) + 2*(n mod 2) = A032766(n) + A000035(n). - Reinhard Zumkeller, Apr 04 2005
a(n) = (6*n+1)/4 - (-1)^n/4; a(n) = Sum_{k=0..n-1} (1 + (-1)^(k/2)*cos(k*Pi/2)). - Paul Barry, Aug 18 2007
A145389(a(n)) <> 1. - Reinhard Zumkeller, Oct 10 2008
a(n) = A002943(n) - A173511(n). - Reinhard Zumkeller, Feb 20 2010
a(n) = 3*n - a(n-1) - 1 (with a(0)=0). - Vincenzo Librandi, Nov 18 2010
a(n) = Sum_{k>=0} A030308(n,k)*A042950(k). - Philippe Deléham, Oct 17 2011
a(n) = n + ceiling(n/2). - Arkadiusz Wesolowski, Sep 18 2012
a(n) = 2n - floor(n/2) = floor((3n+1)/2) = n + (n + (n mod 2))/2. - Wesley Ivan Hurt, Oct 19 2013
a(n) = A000217(n+1) - A099392(n+1). - Bui Quang Tuan, Mar 27 2015
a(n) = n + floor(n/2) + (n mod 2). - Bruno Berselli, Apr 04 2016
a(n) = Sum_{i=1..n} numerator(2/i). - Wesley Ivan Hurt, Feb 26 2017
a(n) = Sum_{k=0..n-1} Sum_{i=0..k} C(i,k)+(-1)^(k-i). - Wesley Ivan Hurt, Sep 20 2017
E.g.f.: (3*exp(x)*x + sinh(x))/2. - Stefano Spezia, Feb 11 2020
Sum_{n>=1} (-1)^(n+1)/a(n) = log(3)/2 - Pi/(6*sqrt(3)). - Amiram Eldar, Dec 04 2021

A033996 8 times triangular numbers: a(n) = 4n(n+1).

Original entry on oeis.org

0, 8, 24, 48, 80, 120, 168, 224, 288, 360, 440, 528, 624, 728, 840, 960, 1088, 1224, 1368, 1520, 1680, 1848, 2024, 2208, 2400, 2600, 2808, 3024, 3248, 3480, 3720, 3968, 4224, 4488, 4760, 5040, 5328, 5624, 5928, 6240, 6560, 6888, 7224, 7568, 7920, 8280

Offset: 0

N. J. A. Sloane, Dec 11 1999

Write 0, 1, 2, ... in a clockwise spiral; sequence gives numbers on one of 4 diagonals.
Also, least m > n such that T(m)*T(n) is a square and more precisely that of A055112(n). {T(n) = A000217(n)}. - Lekraj Beedassy, May 14 2004
Also sequence found by reading the line from 0, in the direction 0, 8, ... and the same line from 0, in the direction 0, 24, ..., in the square spiral whose vertices are the generalized decagonal numbers A074377. Axis perpendicular to A195146 in the same spiral. - Omar E. Pol, Sep 18 2011
Number of diagonals with length sqrt(5) in an (n+1) X (n+1) square grid. Every 1 X 2 rectangle has two such diagonals. - Wesley Ivan Hurt, Mar 25 2015
Imagine a board made of squares (like a chessboard), one of whose squares is completely surrounded by square-shaped layers made of adjacent squares. a(n) is the total number of squares in the first to n-th layer. a(1) = 8 because there are 8 neighbors to the unit square; adding them gives a 3 X 3 square. a(2) = 24 = 8 + 16 because we need 16 more squares in the next layer to get a 5 X 5 square: a(n) = (2*n+1)^2 - 1 counting the (2n+1) X (2n+1) square minus the central square. - R. J. Cano, Sep 26 2015
The three platonic solids (the simplex, hypercube, and cross-polytope) with unit side length in n dimensions all have rational volume if and only if n appears in this sequence, after 0. - Brian T Kuhns, Feb 26 2016
The number of active (ON, black) cells in the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 645", based on the 5-celled von Neumann neighborhood. - Robert Price, May 19 2016
The square root of a(n), n>0, has continued fraction [2n; {1,4n}] with whole number part 2n and periodic part {1,4n}. - Ron Knott, May 11 2017
Numbers k such that k+1 is a square and k is a multiple of 4. - Bruno Berselli, Sep 28 2017
a(n) is the number of vertices of the octagonal network O(n,n); O(m,n) is defined by Fig. 1 of the Siddiqui et al. reference. - Emeric Deutsch, May 13 2018
a(n) is the number of vertices in conjoined n X n octagons which are arranged into a square array, a.k.a. truncated square tiling. - Donghwi Park, Dec 20 2020
a(n-2) is the number of ways to place 3 adjacent marks in a diagonal, horizontal, or vertical row on an n X n tic-tac-toe grid. - Matej Veselovac, May 28 2021

			Spiral with 0, 8, 24, 48, ... along lower right diagonal:
.
  36--37--38--39--40--41--42
   |                       |
  35  16--17--18--19--20  43
   |   |               |   |
  34  15   4---5---6  21  44
   |   |   |       |   |   |
  33  14   3   0   7  22  45
   |   |   |   | \ |   |   |
  32  13   2---1   8  23  46
   |   |           | \ |   |
  31  12--11--10---9  24  47
   |                   | \ |
  30--29--28--27--26--25  48
                            \
[Reformatted by _Jon E. Schoenfield_, Dec 25 2016]

Stuart M. Ellerstein, J. Recreational Math. 29 (3) 188, 1998.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.
Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.

Ivan Panchenko, Table of n, a(n) for n = 0..1000
M. K. Siddiqui, M. Naeem, N. A. Rahman, and M. Imran, Computing topological indices of certain networks, J. of Optoelectronics and Advanced Materials, 18, No. 9-10, 2016, 884-892.
N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015.
Leo Tavares, Illustration: Centroid Diamonds.
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton.
Eric Weisstein's World of Mathematics, Hamiltonian Path.
Eric Weisstein's World of Mathematics, Knight Graph.
Stephen Wolfram, A New Kind of Science
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
Index entries for sequences related to cellular automata
Index to 2D 5-Neighbor Cellular Automata.
Index to Elementary Cellular Automata.

Cf. A000217, A016754, A002378, A024966, A027468, A028895, A028896, A045943, A046092, A049598, A088538, A124080, A008590 (first differences), A130809 (partial sums).
Sequences from spirals: A001107, A002939, A002943, A007742, A033951, A033952, A033953, A033954, A033988, A033989, A033990, A033991, A033996. - Omar E. Pol, Dec 12 2008
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.

[ 4*n*(n+1) : n in [0..50] ]; // Wesley Ivan Hurt, Jun 09 2014

seq(8*binomial(n+1, 2), n=0..46); # Zerinvary Lajos, Nov 24 2006
[seq((2*n+1)^2-1, n=0..46)];

Table[(2n - 1)^2 - 1, {n, 50}] (* Alonso del Arte, Mar 31 2013 *)

nsqm1(n) = { forstep(x=1,n,2, y = x*x-1; print1(y, ", ") ) }

a(n) = 4*n^2 + 4*n = (2*n+1)^2 - 1.
G.f.: 8*x/(1-x)^3.
a(n) = A016754(n) - 1 = 2*A046092(n) = 4*A002378(n). - Lekraj Beedassy, May 25 2004
a(n) = A049598(n) - A046092(n); a(n) = A124080(n) - A002378(n). - Zerinvary Lajos, Mar 06 2007
a(n) = 8*A000217(n). - Omar E. Pol, Dec 12 2008
a(n) = A005843(n) * A163300(n). - Juri-Stepan Gerasimov, Jul 26 2009
a(n) = a(n-1) + 8*n (with a(0)=0). - Vincenzo Librandi, Nov 17 2010
For n > 0, a(n) = A058031(n+1) - A062938(n-1). - Charlie Marion, Apr 11 2013
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Wesley Ivan Hurt, Mar 25 2015
a(n) = A000578(n+1) - A152618(n). - Bui Quang Tuan, Apr 01 2015
a(n) - a(n-1) = A008590(n), n > 0. - Altug Alkan, Sep 26 2015
From Ilya Gutkovskiy, May 19 2016: (Start)
E.g.f.: 4*x*(2 + x)*exp(x).
Sum_{n>=1} 1/a(n) = 1/4. (End)
Product_{n>=1} a(n)/A016754(n) = Pi/4. - Daniel Suteu, Dec 25 2016
a(n) = A056220(n) + A056220(n+1). - Bruce J. Nicholson, May 29 2017
sqrt(a(n)+1) - sqrt(a(n)) = (sqrt(n+1) - sqrt(n))^2. - Seiichi Manyama, Dec 23 2018
a(n)*a(n+k) + 4*k^2 = m^2 where m = (a(n) + a(n+k))/2 - 2*k^2; for k=1, m = 4*n^2 + 8*n + 2 = A060626(n). - Ezhilarasu Velayutham, May 22 2019
Sum_{n>=1} (-1)^n/a(n) = 1/4 - log(2)/2. - Vaclav Kotesovec, Dec 21 2020
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(4/Pi)*cos(Pi/sqrt(2)).
Product_{n>=1} (1 + 1/a(n)) = 4/Pi (A088538). (End)

A174344 List of x-coordinates of point moving in clockwise square spiral.

Original entry on oeis.org

0, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 0, -1, -2, -3, -4, -4, -4, -4, -4, -4, -4, -4, -4, -3, -2

Offset: 1

Nikolas Garofil (nikolas(AT)garofil.be), Mar 16 2010

sign

Also, list of x-coordinates of point moving in counterclockwise square spiral.
This spiral, in either direction, is sometimes called the "Ulam spiral", but "square spiral" is a better name. (Ulam looked at the positions of the primes, but of course the spiral itself must be much older.) - N. J. A. Sloane, Jul 17 2018
Graham, Knuth and Patashnik give an exercise and answer on mapping n to square spiral x,y coordinates, and back x,y to n.  They start 0 at the origin and first segment North so their y(n) is a(n+1).  In their table of sides, it can be convenient to take n-4*k^2 so the ranges split at -m, 0, m. - Kevin Ryde, Sep 16 2019

			Here is the beginning of the clockwise square spiral. Sequence gives x-coordinate of the n-th point.
.
  20--21--22--23--24--25
   |                   |
  19   6---7---8---9  26
   |   |           |   |
  18   5   0---1  10  27
   |   |       |   |   |
  17   4---3---2  11  28
   |               |   |
  16--15--14--13--12  29
                       |
  35--34--33--32--32--30
.
Given the offset equal to 1, a(n) gives the x-coordinate of the point labeled n-1 in the above drawing. - _M. F. Hasler_, Nov 03 2019

Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Concrete Mathematics, Addison-Wesley, 1989, chapter 3, Integer Functions, exercise 40 page 99 and answer page 498.

Peter Kagey, Table of n, a(n) for n = 1..10000
Seppo Mustonen, Ulam spiral in color [Interactive web page]
Seppo Mustonen, Ulam spiral in color [Local copy of a snapshot of the page]
Hugo Pfoertner, Visualization of spiral using Plot 2, May 29 2018
N. J. A. Sloane, Ulam spiral in color.
Aaron Snook, Augmented Integer Linear Recurrences, Thesis, 2012.
Index entries for sequences related to coordinates of 2D curves

Cf. A180714. A268038 (or A274923) gives sequence of y-coordinates.
The (x,y) coordinates for a point sweeping a quadrant by antidiagonals are (A025581, A002262). - N. J. A. Sloane, Jul 17 2018
See A296030 for the pairs (A174344(n), A274923(n)). - M. F. Hasler, Oct 20 2019
The diagonal rays are: A002939 (2*n*(2*n-1): 0, 2, 12, 30, ...), A016742 = (4n^2: 0, 4, 16, 36, ...), A002943 (2n(2n+1): 0, 6, 20, 42, ...), A033996 = (4n(n+1): 0, 8, 24, 48, ...). - M. F. Hasler, Oct 31 2019

function SquareSpiral(len)
    x, y, i, j, N, n, c = 0, 0, 0, 0, 0, 0, 0
    for k in 0:len-1
        print("$x, ") # or print("$y, ") for A268038.
        if n == 0
            c += 1; c > 3 && (c =  0)
            c == 0 && (i = 0; j =  1)
            c == 1 && (i = 1; j =  0)
            c == 2 && (i = 0; j = -1)
            c == 3 && (i = -1; j = 0)
            c in [1, 3] && (N += 1)
            n = N
        end
        n -= 1
        x, y = x + i, y + j
end end
SquareSpiral(75) # Peter Luschny, May 05 2019

fx:=proc(n) option remember; local k; if n=1 then 0 else
k:=floor(sqrt(4*(n-2)+1)) mod 4;
fx(n-1) + sin(k*Pi/2); fi; end;
[seq(fx(n),n=1..120)]; # Based on Seppo Mustonen's formula. - N. J. A. Sloane, Jul 11 2016

a[n_]:=a[n]=If[n==0,0,a[n-1]+Sin[Mod[Floor[Sqrt[4*(n-1)+1]],4]*Pi/2]]; Table[a[n],{n,0,50}] (* Seppo Mustonen, Aug 21 2010 *)

L=0; d=1;
for(r=1,9,d=-d;k=floor(r/2)*d;for(j=1,L++,print1(k,", "));forstep(j=k-d,-floor((r+1)/2)*d+d,-d,print1(j,", "))) \\ Hugo Pfoertner, Jul 28 2018

a(n) = n--; my(m=sqrtint(n),k=ceil(m/2)); n -= 4*k^2; if(n<0, if(n<-m, k, -k-n), if(nKevin Ryde, Sep 16 2019

apply( A174344(n)={my(m=sqrtint(n-=1), k=m\/2); if(n < 4*k^2-m, k, 0 > n -= 4*k^2, -k-n, n < m, -k, n-3*k)}, [1..99]) \\ M. F. Hasler, Oct 20 2019

# Based on Kevin Ryde's PARI script
import math
def A174344(n):
    n -= 1
    m = math.isqrt(n)
    k = math.ceil(m/2)
    n -= 4*k*k
    if n < 0: return k if n < -m else -k-n
    return -k if n < m else n-3*k # David Radcliffe, Aug 04 2025

a(1) = 0, a(n) = a(n-1) + sin(floor(sqrt(4n-7))*Pi/2). For a corresponding formula for the y-coordinate, replace sin with cos. - Seppo Mustonen, Aug 21 2010 with correction by Peter Kagey, Jan 24 2016

a(n) = A010751(A037458(n-1)) for n>1. - William McCarty, Jul 29 2021

Link corrected by Seppo Mustonen, Sep 05 2010

Definition clarified by N. J. A. Sloane, Dec 20 2012

A007742 a(n) = n(4n+1).

Original entry on oeis.org

0, 5, 18, 39, 68, 105, 150, 203, 264, 333, 410, 495, 588, 689, 798, 915, 1040, 1173, 1314, 1463, 1620, 1785, 1958, 2139, 2328, 2525, 2730, 2943, 3164, 3393, 3630, 3875, 4128, 4389, 4658, 4935, 5220, 5513, 5814, 6123, 6440, 6765, 7098, 7439, 7788, 8145

Offset: 0

N. J. A. Sloane

Write 0,1,2,... in a clockwise spiral; sequence gives the numbers that fall on the positive y-axis. (See Example section.)
Central terms of the triangle in A126890. - Reinhard Zumkeller, Dec 30 2006
a(n)*Pi is the total length of 4 points circle center spiral after n rotations. The spiral length at each rotation (L(n)) is A004770. The spiral length ratio rounded down [floor(L(n)/L(1))] is A047497. See illustration in links. - Kival Ngaokrajang, Dec 27 2013
For n >= 1, the continued fraction expansion of sqrt(a(n)) is [2n; {4, 4n}]. For n=1, this collapses to [2, {4}]. - Magus K. Chu, Sep 15 2022

			Part of the spiral:
.
  64--65--66--67--68
   |
  63  36--37--38--39--40--41--42
   |   |                       |
  62  35  16--17--18--19--20  43
   |   |   |               |   |
  61  34  15   4---5---6  21  44
   |   |   |   |       |   |   |
  60  33  14   3   0   7  22  45
   |   |   |   |   |   |   |   |
  59  32  13   2---1   8  23  46
   |   |   |           |   |   |
  58  31  12--11--10---9  24  47
   |   |                   |   |
  57  30--29--28--27--26--25  48
   |                           |
  56--55--54--53--52--51--50--49

S. M. Ellerstein, The square spiral, J. Recreational Mathematics 29 (#3, 1998) 188; 30 (#4, 1999-2000), 246-250.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Emilio Apricena, A version of the Ulam spiral
Robert FERREOL, Illustration by pentagons
Kival Ngaokrajang, Illustration of 4 points circle center spiral
Leo Tavares, Illustration: Triangular Layers
G. Thimm, Emails to N. J. A. Sloane, Sep. 1994
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A033991, A074378.
Sequences from spirals: A001107, A002939, A007742, A033951, A033952, A033953, A033954, A033989, A033990, A033991, A002943, A033996, A033988.
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. index to sequences with numbers of the form n*(d*n+10-d)/2 in A140090.
Cf. A081266.

I:=[0, 5, 18]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]]; // Vincenzo Librandi, Jan 29 2012

LinearRecurrence[{3,-3,1},{0,5,18},50] (* Vincenzo Librandi, Jan 29 2012 *)
Table[n(4n+1),{n,0,50}] (* Harvey P. Dale, Aug 10 2017 *)

PARI
```
a(n)=4*n^2+n
```

G.f.: x*(5+3*x)/(1-x)^3. - Michael Somos, Mar 03 2003
a(n) = A033991(-n) = A074378(2*n).
a(n) = floor((n + 1/4)^2). - Reinhard Zumkeller, Feb 20 2010
a(n) = A110654(n) + A173511(n) = A002943(n) - n. - Reinhard Zumkeller, Feb 20 2010
a(n) = 8*n + a(n-1) - 3. - Vincenzo Librandi, Nov 21 2010
Sum_{n>=1} 1/a(n) = Sum_{k>=0} (-1)^k*zeta(2+k)/4^(k+1) = 0.349762131... . - R. J. Mathar, Jul 10 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2, a(0)=0, a(1)=5, a(2)=18. - Philippe Deléham, Mar 26 2013
a(n) = A118729(8n+4). - Philippe Deléham, Mar 26 2013
a(n) = A000217(3*n) - A000217(n). - Bruno Berselli, Sep 21 2016
E.g.f.: (4*x^2 + 5*x)*exp(x). - G. C. Greubel, Jul 17 2017
From Amiram Eldar, Jul 03 2020: (Start)
Sum_{n>=1} 1/a(n) = 4 - Pi/2 - 3*log(2).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/sqrt(2) + log(2) + sqrt(2)*log(1 + sqrt(2)) - 4. (End)
a(n) = A081266(n) - A000217(n). - Leo Tavares, Mar 25 2022

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

Original entry on oeis.org

1, 5, 17, 37, 65, 101, 145, 197, 257, 325, 401, 485, 577, 677, 785, 901, 1025, 1157, 1297, 1445, 1601, 1765, 1937, 2117, 2305, 2501, 2705, 2917, 3137, 3365, 3601, 3845, 4097, 4357, 4625, 4901, 5185, 5477, 5777, 6085, 6401, 6725, 7057

Offset: 0

Stuart M. Ellerstein (ellerstein(AT)aol.com), Apr 06 2000

Subsequence of A004613: all numbers in this sequence have all prime factors of the form 4k+1. E.g., 40001 = 13*17*181, 13 = 4*3 + 1, 17 = 4*4 + 1, 181 = 4*45 + 1. - Cino Hilliard, Aug 26 2006, corrected by Franklin T. Adams-Watters, Mar 22 2011
A000466(n), A008586(n) and a(n) are Pythagorean triples. - Zak Seidov, Jan 16 2007
Solutions x of the Mordell equation y^2 = x^3 - 3a^2 - 1 for a = 0, 1, 2, ... - Michel Lagneau, Feb 12 2010
Ulam's spiral (NW spoke). - Robert G. Wilson v, Oct 31 2011
For n >= 1, a(n) is numerator of radius r(n) of circle with sagitta = n and cord length = 1. The denominator is A008590(n). - Kival Ngaokrajang, Jun 13 2014
a(n)+6 is prime for n = 0..6 and for n = 15..20. - Altug Alkan, Sep 28 2015

Donald E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, 1997, Vol. 1, exercise 1.2.1 Nr. 11, p. 19.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 3.
Roland Bacher, Counting Packings of Generic Subsets in Finite Groups, Electr. J. Combinatorics, 19 (2012), #P7. - From _N. J. A. Sloane_, Feb 06 2013
Kival Ngaokrajang, Illustration of initial terms.
Robert G. Wilson v, Cover of the March 1964 issue of Scientific American.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Column 2 of array A188647.
Cf. A016742, A256970 (smallest prime factors), A214345.
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. A000466, A001844, A004613, A008586, A008590, A017113, A046092, A087475, A156701, A176271.

List([0..45],n->4*n^2+1); # Muniru A Asiru, Nov 01 2018

a053755 = (+ 1) . (* 4) . (^ 2)  -- Reinhard Zumkeller, Apr 20 2015

m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!((1+2*x+5*x^2)/((1-x)^3))); /* or */ I:=[1,5]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2)+8: n in [1..50]]; // Vincenzo Librandi, Jun 26 2013

with (combinat):seq(fibonacci(3,2*n), n=0..42); # Zerinvary Lajos, Apr 21 2008

f[n_] := 4n^2 +1; Array[f, 40] (* Vladimir Joseph Stephan Orlovsky, Sep 02 2008 *)
CoefficientList[Series[(1 + 2 x + 5 x^2) / (1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Jun 26 2013 *)
LinearRecurrence[{3,-3,1},{1,5,17},50] (* Harvey P. Dale, Dec 28 2021 *)

for(x=0,100,print1(4*x^2+1",")) \\ Cino Hilliard, Aug 26 2006

for n in range(0,50): print(4*n**2+1, end=', ') # Stefano Spezia, Nov 01 2018

a(n) = A000466(n) + 2. - Zak Seidov, Jan 16 2007
From R. J. Mathar, Apr 28 2008: (Start)
O.g.f.: (1 + 2*x + 5*x^2)/(1-x)^3.
a(n) = 3a(n-1) - 3a(n-2) + a(n-3). (End)
Equals binomial transform of [1, 4, 8, 0, 0, 0, ...]. - Gary W. Adamson, Apr 30 2008
a(n) = A156701(n)/A087475(n). - Reinhard Zumkeller, Feb 13 2009
For n>0: a(n) = A176271(2*n,n+1); cf. A016754, A000466. - Reinhard Zumkeller, Apr 13 2010
a(n+1) = denominator of Sum_{k=0..n} (-1)^n*(2*n + 1)^3/((2*n + 1)^4 + 4), see Knuth reference. - Reinhard Zumkeller, Apr 11 2010
a(n) = 8*n + a(n-1) - 4. with a(0)=1. - Vincenzo Librandi, Aug 06 2010
a(n) = ((2*n - 1)^2 + (2*n + 1)^2)/2. - J. M. Bergot, May 31 2012
a(n) = 2*a(n-1) - a(n-2) + 8 with a(0)=1, a(1)=5. - Vincenzo Librandi, Jun 26 2013
a(n+1) = a(n) + A017113(n), a(0) = 1. - Altug Alkan, Sep 26 2015
a(n) = A001844(n) + A046092(n-1) = A001844(n-1) + A046092(n). - Bruce J. Nicholson, Aug 07 2017
From Amiram Eldar, Jul 15 2020: (Start)
Sum_{n>=0} 1/a(n) = (1 + (Pi/2)*coth(Pi/2))/2.
Sum_{n>=0} (-1)^n/a(n) = (1 + (Pi/2)*csch(Pi/2))/2. (End)
From Amiram Eldar, Feb 05 2021: (Start)
Product_{n>=0} (1 + 1/a(n)) = sqrt(2)*csch(Pi/2)*sinh(Pi/sqrt(2)).
Product_{n>=1} (1 - 1/a(n)) = (Pi/2)*csch(Pi/2). (End)
E.g.f.: exp(x)*(1 + 2*x)^2. - Stefano Spezia, Jun 10 2021

Equation corrected, and examples that were based on a different offset removed, by R. J. Mathar, Mar 18 2010

A033991 a(n) = n(4n-1).

Original entry on oeis.org

0, 3, 14, 33, 60, 95, 138, 189, 248, 315, 390, 473, 564, 663, 770, 885, 1008, 1139, 1278, 1425, 1580, 1743, 1914, 2093, 2280, 2475, 2678, 2889, 3108, 3335, 3570, 3813, 4064, 4323, 4590, 4865, 5148, 5439, 5738, 6045, 6360, 6683, 7014, 7353, 7700, 8055, 8418

Offset: 0

N. J. A. Sloane

Write 0,1,2,... in a clockwise spiral; sequence gives numbers on negative x axis. (See illustration in Example.)
This sequence is the number of expressions x generated for a given modulus n in finite arithmetic. For example, n=1 (modulus 1) generates 3 expressions: 0+0=0(mod 1), 0-0=0(mod 1), 0*0=0(mod 1). By subtracting n from 4n^2, we eliminate the counting of those expressions that would include division by zero, which would be, of course, undefined. - David Quentin Dauthier, Nov 04 2007
From Emeric Deutsch, Sep 21 2010: (Start)
a(n) is also the Wiener index of the windmill graph D(3,n).
The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs). The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph.
Example: a(2)=14; indeed if the triangles are OAB and OCD, then, denoting distance by d, we have d(O,A)=d(O,B)=d(A,B)=d(O,C)=d(O,D)=d(C,D)=1 and d(A,C)=d(A,D)=d(B,C)=d(B,D)=2. The Wiener index of D(m,n) is (1/2)n(m-1)[(m-1)(2n-1)+1]. For the Wiener indices of D(4,n), D(5,n), and D(6,n) see A152743, A028994, and A180577, respectively. (End)
Even hexagonal numbers divided by 2. - Omar E. Pol, Aug 18 2011
For n > 0, a(n) equals the number of length 3*n binary words having exactly two 0's with the n first bits having at most one 0. For example a(2) = 14. Words are 010111, 011011, 011101, 011110, 100111, 101011, 101101, 101110, 110011, 110101, 110110, 111001, 111010, 111100. - Franck Maminirina Ramaharo, Mar 09 2018
For n >= 1, the continued fraction expansion of sqrt(a(n)) is [2n-1; {1, 2, 1, 4n-2}]. For n=1, this collapses to [1; {1, 2}]. - Magus K. Chu, Sep 06 2022

			Clockwise spiral (with sequence terms parenthesized) begins
   16--17--18--19
    |
   15   4---5---6
    |   |       |
  (14) (3) (0)  7
    |   |   |   |
   13   2---1   8
    |           |
   12--11--10---9

S. M. Ellerstein, The square spiral, J. Recreational Mathematics 29 (#3, 1998) 188; 30 (#4, 1999-2000), 246-250.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Emilio Apricena, A version of the Ulam spiral.
Eric W. Weisstein, Windmill Graph.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Sequences from spirals: A001107, A002939, A007742, A033951-A033954, A033989-A033991, A002943, A033996, A033988.
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. A074378, A014848, A152743, A028994, A000326, A001105, A005476, A014635, A016742, A049452, A118729.

[seq(binomial(4*n, 2)/2, n=0..45)]; # Zerinvary Lajos, Jan 16 2007

Table[n*(4*n - 1), {n, 0, 100}] (* Vladimir Joseph Stephan Orlovsky, Jul 06 2011 *)
LinearRecurrence[{3,-3,1},{0,3,14},50] (* Harvey P. Dale, Oct 10 2011 *)

PARI
```
a(n)=4*n^2-n;
```

a(n) = A007742(-n) = A074378(2n-1) = A014848(2n).
G.f.: x*(3+5*x)/(1-x)^3. - Michael Somos, Mar 03 2003
a(n) = A014635(n)/2. - Zerinvary Lajos, Jan 16 2007
From Zerinvary Lajos, Jun 12 2007: (Start)
a(n) = A000326(n) + A005476(n).
a(n) = A049452(n) - A001105(n). (End)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. - Harvey P. Dale, Oct 10 2011
a(n) = A118729(8n+2). - Philippe Deléham, Mar 26 2013
From Ilya Gutkovskiy, Dec 04 2016: (Start)
E.g.f.: x*(3 + 4*x)*exp(x).
Sum_{n>=1} 1/a(n) = 3*log(2) - Pi/2 = 0.50864521488... (End)
a(n) = Sum_{i=n..3n-1} i. - Wesley Ivan Hurt, Dec 04 2016
From Franck Maminirina Ramaharo, Mar 09 2018: (Start)
a(n) = binomial(2*n, 2) + 2*n^2.
a(n) = A054556(n+1) - 1. (End)
Sum_{n>=1} (-1)^(n+1)/a(n) = (Pi + log(3-2*sqrt(2)))/sqrt(2) - log(2). - Amiram Eldar, Mar 20 2022

Two remarks combined into one by Emeric Deutsch, Oct 03 2010

A274923 List of y-coordinates of point moving in counterclockwise square spiral.

Original entry on oeis.org

0, 0, 1, 1, 1, 0, -1, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 0, -1, -2, -3, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -3, -2, -1, 0

Offset: 1

N. J. A. Sloane, Jul 11 2016

This spiral, in either direction, is sometimes called the "Ulam spiral, but "square spiral" is a better name. (Ulam looked at the positions of the primes, but of course the spiral itself must be much older.) - N. J. A. Sloane, Jul 17 2018

Graham, Knuth and Patashnik give an exercise and answer on mapping n to square spiral x,y coordinates, and back x,y to n. They start 0 at the origin and first segment North so a(n) is their -x(n-1). In their table of sides, it can be convenient to take n-4*k^2 so the ranges split at -m, 0, m. - Kevin Ryde, Sep 17 2019

Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Concrete Mathematics, Addison-Wesley, 1989, chapter 3, Integer Functions, exercise 40 page 99 and answer page 498.

Alois P. Heinz, Table of n, a(n) for n = 1..10000
Visualization of spiral using Plot 2. - _Hugo Pfoertner_, May 29 2018
Index entries for sequences related to coordinates of 2D curves

Cf. A268038 (negated), A317186 (indices of 0's).
Cf. A174344 (x-coordinates).
The (x,y) coordinates for a point sweeping a quadrant by antidiagonals are (A025581, A002262). - N. J. A. Sloane, Jul 17 2018
A296030 gives pairs (x = A174344(n), y = a(n)). - M. F. Hasler, Oct 20 2019
The diagonal rays of the square spiral (coordinates (+-n,+-n)) are: A002939 (2n(2n-1): 0, 2, 12, 30, ...), A016742 = (4n^2: 0, 4, 16, 36, ...), A002943 (2n(2n+1): 0, 6, 20, 42, ...), A033996 = (4n(n+1): 0, 8, 24, 48, ...). - M. F. Hasler, Oct 31 2019

fy:=proc(n) option remember; local k; if n=1 then 0 else
k:=floor(sqrt(4*(n-2)+1)) mod 4;
fy(n-1) - cos(k*Pi/2); fi; end;
[seq(fy(n),n=1..120)]; # Based on Seppo Mustonen's formula in A174344.

a[n_] := a[n] = If[n == 0, 0, a[n-1] - Cos[Mod[Floor[Sqrt[4*(n-1)+1]], 4]* Pi/2]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Jun 11 2018, after Seppo Mustonen *)

L=1;d=1;
for(r=1,9,d=-d;k=floor(r/2)*d;for(j=1,L++,print1(k,", "));forstep(j=k-d,-floor((r+1)/2)*d+d,-d,print1(j,", "))) \\ Hugo Pfoertner, Jul 28 2018

a(n) = n--; my(m=sqrtint(n), k=ceil(m/2)); n -= 4*k^2; if(n<0, if(n<-m, 3*k+n, k), if(nKevin Ryde, Sep 17 2019

apply( A274923(n)={my(m=sqrtint(n-=1), k=m\/2); if(m <= n -= 4*k^2, -k, n >= 0, k-n, n >= -m, k, 3*k+n)}, [1..99]) \\ M. F. Hasler, Oct 20 2019

# Based on Kevin Ryde's PARI script
import math
def A274923(n):
    n -= 1
    m = math.isqrt(n)
    k = math.ceil(m/2)
    n -= 4*k*k
    if n < 0: return 3*k+n if n < -m else k
    return k-n if n < m else -k # David Radcliffe, Aug 04 2025

A033951 Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.

Original entry on oeis.org

1, 8, 23, 46, 77, 116, 163, 218, 281, 352, 431, 518, 613, 716, 827, 946, 1073, 1208, 1351, 1502, 1661, 1828, 2003, 2186, 2377, 2576, 2783, 2998, 3221, 3452, 3691, 3938, 4193, 4456, 4727, 5006, 5293, 5588, 5891, 6202, 6521, 6848, 7183, 7526, 7877, 8236, 8603, 8978

Offset: 0

Olivier Gorin (gorin(AT)roazhon.inra.fr)

Ulam's spiral (S spoke of A054552). - Robert G. Wilson v, Oct 31 2011

a(n) is the first term in a sum of 2*n + 1 consecutive integers that equals (2*n + 1)^3. - Patrick J. McNab, Dec 24 2016

			Spiral begins:
.
  65--66--67--68--69--70--71--72--73
   |                               |
  64  37--38--39--40--41--42--43  74
   |   |                       |   |
  63  36  17--18--19--20--21  44  75
   |   |   |               |   |   |
  62  35  16   5---6---7  22  45  76
   |   |   |   |       |   |   |   |
  61  34  15   4   1   8  23  46  77
   |   |   |   |   |   |   |   |
  60  33  14   3---2   9  24  47
   |   |   |           |   |   |
  59  32  13--12--11--10  25  48
   |   |                   |   |
  58  31--30--29--28--27--26  49
   |                           |
  57--56--55--54--53--52--51--50
From _Aaron David Fairbanks_, Mar 06 2025: (Start)
Illustration of initial terms:
                                            o o o o
                        o o o             o o o o o o
          o o         o o o o o         o o o o o o o o
  o     o o o o     o o o o o o o     o o o o o o o o o o
          o o         o o o o o         o o o o o o o o
                        o o o             o o o o o o
                                            o o o o
  1        8              23                   46
(End)

Ivan Panchenko, Table of n, a(n) for n = 0..1000
Robert G. Wilson v, Cover of the March 1964 issue of Scientific American
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Sequences from spirals: A001107, A002939, A007742, A033951, A033952, A033953, A033954, A033989, A033990, A033991, A002943, A033996, A033988.
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. A014848, A132774.

A033951:=n->4*n^2 + 3*n + 1: seq(A033951(n), n=0..100); # Wesley Ivan Hurt, Feb 11 2017

lst={};Do[p=4*n^2+3*n+1;AppendTo[lst, p], {n, 1, 6!}];lst (* Vladimir Joseph Stephan Orlovsky, Sep 01 2008 *)
LinearRecurrence[{3,-3,1},{1,8,23},60] (* Harvey P. Dale, Feb 07 2015 *)
CoefficientList[Series[(1 + 5 x + 2 x^2)/(1 - x)^3, {x, 0, 45}], x] (* Michael De Vlieger, Feb 12 2017 *)

PARI
```
a(n)=4*n^2+3*n+1
```

[4*n**2 + 3*n + 1 for n in range(46)] # Michael S. Branicky, Jan 08 2021

a(n) = 4*n^2 + 3*n + 1.
G.f.: (1 + 5*x + 2*x^2)/(1-x)^3.
A014848(2n+1) = a(n).
Equals A132774 * [1, 2, 3, ...]; = binomial transform of [1, 7, 8, 0, 0, 0, ...]. - Gary W. Adamson, Aug 28 2007
a(n) = A016754(n) - n. - Reinhard Zumkeller, May 17 2009
a(n) = a(n-1) + 8*n-1 (with a(0)=1). - Vincenzo Librandi, Nov 17 2010
a(0)=1, a(1)=8, a(2)=23, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Feb 07 2015
E.g.f.: exp(x)*(1 + 7*x + 4*x^2). - Stefano Spezia, Apr 24 2024

Extended (with formula) by Erich Friedman

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

Original entry on oeis.org

1, 2, 11, 28, 53, 86, 127, 176, 233, 298, 371, 452, 541, 638, 743, 856, 977, 1106, 1243, 1388, 1541, 1702, 1871, 2048, 2233, 2426, 2627, 2836, 3053, 3278, 3511, 3752, 4001, 4258, 4523, 4796, 5077, 5366, 5663, 5968, 6281, 6602, 6931, 7268, 7613, 7966, 8327

Offset: 0

Enoch Haga and G. L. Honaker, Jr., Apr 09 2000

Also indices in any square spiral organized like A054551.
Equals binomial transform of [1, 1, 8, 0, 0, 0, ...]. - Gary W. Adamson, May 11 2008
Ulam's spiral (E spoke). - Robert G. Wilson v, Oct 31 2011
For n > 0: left edge of the triangle A033293. - Reinhard Zumkeller, Jan 18 2012

			The spiral begins:
.
197-196-195-194-193-192-191-190-189-188-187-186-185-184-183
  |                                                       |
198 145-144-143-142-141-140-139-138-137-136-135-134-133 182
  |   |                                               |   |
199 146 101-100--99--98--97--96--95--94--93--92--91 132 181
  |   |   |                                       |   |   |
200 147 102  65--64--63--62--61--60--59--58--57  90 131 180
  |   |   |   |                               |   |   |   |
201 148 103  66  37--36--35--34--33--32--31  56  89 130 179
  |   |   |   |   |                       |   |   |   |   |
202 149 104  67  38  17--16--15--14--13  30  55  88 129 178
  |   |   |   |   |   |               |   |   |   |   |   |
203 150 105  68  39  18   5---4---3  12  29  54  87 128 177
  |   |   |   |   |   |   |       |   |   |   |   |   |   |
204 151 106  69  40  19   6   1---2  11  28  53  86 127 176
  |   |   |   |   |   |   |           |   |   |   |   |   |
205 152 107  70  41  20   7---8---9--10  27  52  85 126 175
  |   |   |   |   |   |                   |   |   |   |   |
206 153 108  71  42  21--22--23--24--25--26  51  84 125 174
  |   |   |   |   |                           |   |   |   |
207 154 109  72  43--44--45--46--47--48--49--50  83 124 173
  |   |   |   |                                   |   |   |
208 155 110  73--74--75--76--77--78--79--80--81--82 123 172
  |   |   |                                           |   |
209 156 111-112-113-114-115-116-117-118-119-120-121-122 171
  |   |                                                   |
210 157-158-159-160-161-162-163-164-165-166-167-168-169-170
  |
211-212-213-214-215-216-217-218-219-220-221-222-223-224-225
.
- _Robert G. Wilson v_, Jul 04 2014

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Scientific American, Cover of the March 1964 issue
Leo Tavares, Illustration: Hexagon/Square Pairs
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A033293, A054551, A108781.
Spokes of square spiral: A054552, A054554, A054556, A053755, A054567, A054569, A033951, A016754.
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. A003215.

[4*n^2-3*n+1 : n in [0..50]]; // Wesley Ivan Hurt, Jul 11 2014

A054552:=n->4*n^2-3*n+1: seq(A054552(n), n=0..50); # Wesley Ivan Hurt, Jul 11 2014

f[n_] := 4*n^2 - 3*n + 1; Array[f, 50, 0] (* Vladimir Joseph Stephan Orlovsky, Sep 01 2008 *)
LinearRecurrence[{3,-3,1},{1,2,11},50] (* Harvey P. Dale, Jun 01 2024 *)

a(n)= 4*n^2-3*n+1 \\ Charles R Greathouse IV, Jan 15 2012

G.f.: (1 - x + 8*x^2)/(1-x)^3.
a(n) = 8*n + a(n-1) - 7 (with a(0)=1). - Vincenzo Librandi, Aug 07 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(0)=1, a(1)=2, a(2)=11. - Harvey P. Dale, Oct 10 2011
E.g.f.: exp(x)*(1 + x + 4*x^2). - Stefano Spezia, May 14 2021
a(n) = A003215(n-1) + A000290(n). - Leo Tavares, Jul 21 2022

cp's OEIS Frontend

A002939 a(n) = 2*n*(2*n-1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A007494 Numbers that are congruent to 0 or 2 mod 3.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

A033996 8 times triangular numbers: a(n) = 4*n*(n+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A174344 List of x-coordinates of point moving in clockwise square spiral.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Julia

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A007742 a(n) = n*(4*n+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

A002939 a(n) = 2n(2*n-1).

A033996 8 times triangular numbers: a(n) = 4n(n+1).

A007742 a(n) = n(4n+1).

A033991 a(n) = n(4n-1).

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