A032528 -id:A032528 - cp's OEIS frontend

A007310 Numbers congruent to 1 or 5 mod 6.

1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 55, 59, 61, 65, 67, 71, 73, 77, 79, 83, 85, 89, 91, 95, 97, 101, 103, 107, 109, 113, 115, 119, 121, 125, 127, 131, 133, 137, 139, 143, 145, 149, 151, 155, 157, 161, 163, 167, 169, 173, 175

Offset: 1

C. Christofferson (Magpie56(AT)aol.com)

Numbers n such that phi(4n) = phi(3n). - Benoit Cloitre, Aug 06 2003
Or, numbers relatively prime to 2 and 3, or coprime to 6, or having only prime factors >= 5; also known as 5-rough numbers. (Edited by M. F. Hasler, Nov 01 2014: merged with comments from Zak Seidov, Apr 26 2007 and Michael B. Porter, Oct 09 2009)
Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0( 38 ).
Numbers k such that k mod 2 = 1 and (k+1) mod 3 <> 1. - Klaus Brockhaus, Jun 15 2004
Also numbers n such that the sum of the squares of the first n integers is divisible by n, or A000330(n) = n*(n+1)*(2*n+1)/6 is divisible by n. - Alexander Adamchuk, Jan 04 2007
Numbers n such that the sum of squares of n consecutive integers is divisible by n, because A000330(m+n) - A000330(m) = n*(n+1)*(2*n+1)/6 + n*(m^2+n*m+m) is divisible by n independent of m. - Kaupo Palo, Dec 10 2016
A126759(a(n)) = n + 1. - Reinhard Zumkeller, Jun 16 2008
Terms of this sequence (starting from the second term) are equal to the result of the expression sqrt(4!*(k+1) + 1) - but only when this expression yields integral values (that is when the parameter k takes values, which are terms of A144065). - Alexander R. Povolotsky, Sep 09 2008
For n > 1: a(n) is prime if and only if A075743(n-2) = 1; a(2*n-1) = A016969(n-1), a(2*n) = A016921(n-1). - Reinhard Zumkeller, Oct 02 2008
A156543 is a subsequence. - Reinhard Zumkeller, Feb 10 2009
Numbers n such that ChebyshevT(x, x/2) is not an integer (is integer/2). - Artur Jasinski, Feb 13 2010
If 12*k + 1 is a perfect square (k = 0, 2, 4, 10, 14, 24, 30, 44, ... = A152749) then the square root of 12*k + 1 = a(n). - Gary Detlefs, Feb 22 2010
A089128(a(n)) = 1. Complement of A047229(n+1) for n >= 1. See A164576 for corresponding values A175485(a(n)). - Jaroslav Krizek, May 28 2010
Cf. property described by Gary Detlefs in A113801 and in Comment: more generally, these numbers are of the form (2*h*n+(h-4)*(-1)^n-h)/4 (with h, n natural numbers), therefore ((2*h*n+(h-4)*(-1)^n-h)/4)^2-1 == 0 (mod h); in this case, a(n)^2 - 1 == 0 (mod 6). Also a(n)^2 - 1 == 0 (mod 12). - Bruno Berselli, Nov 05 2010 - Nov 17 2010
Numbers n such that ( Sum_{k = 1..n} k^14 ) mod n = 0. (Conjectured) - Gary Detlefs, Dec 27 2011
From Peter Bala, May 02 2018: (Start)
The above conjecture is true. Apply Ireland and Rosen, Proposition 15.2.2. with m = 14 to obtain the congruence 6*( Sum_{k = 1..n} k^14 )/n = 7 (mod n), true for all n >= 1.  Suppose n is coprime to 6, then 6 is a unit in Z/nZ, and it follows from the congruence that ( Sum_{k = 1..n} k^14 )/n is an integer. On the other hand, if either 2 divides n or 3 divides n then the congruence shows that ( Sum_{k = 1..n} k^14 )/n cannot be integral. (End)
A126759(a(n)) = n and A126759(m) < n for m < a(n). - Reinhard Zumkeller, May 23 2013
(a(n-1)^2 - 1)/24 = A001318(n), the generalized pentagonal numbers. - Richard R. Forberg, May 30 2013
Numbers k for which A001580(k) is divisible by 3. - Bruno Berselli, Jun 18 2014
Numbers n such that sigma(n) + sigma(2n) = sigma(3n). - Jahangeer Kholdi and Farideh Firoozbakht, Aug 15 2014
a(n) are values of k such that Sum_{m = 1..k-1} m*(k-m)/k is an integer. Sums for those k are given by A062717. Also see Detlefs formula below based on A062717. - Richard R. Forberg, Feb 16 2015
a(n) are exactly those positive integers m such that the sequence b(n) = n*(n + m)*(n + 2*m)/6 is integral, and also such that the sequence c(n) = n*(n + m)*(n + 2*m)*(n + 3*m)/24 is integral. Cf. A007775. - Peter Bala, Nov 13 2015
Along with 2, these are the numbers k such that the k-th Fibonacci number is coprime to every Lucas number. - Clark Kimberling, Jun 21 2016
This sequence is the Engel expansion of 1F2(1; 5/6, 7/6; 1/36) + 1F2(1; 7/6, 11/6; 1/36)/5. - Benedict W. J. Irwin, Dec 16 2016
The sequence a(n), n >= 4 is generated by the successor of the pair of polygonal numbers {P_s(4) + 1, P_(2*s - 1)(3) + 1}, s >= 3. - Ralf Steiner, May 25 2018
The asymptotic density of this sequence is 1/3. - Amiram Eldar, Oct 18 2020
Also, the only vertices in the odd Collatz tree A088975 that are branch values to other odd nodes t == 1 (mod 2) of A005408. - Heinz Ebert, Apr 14 2021
From Flávio V. Fernandes, Aug 01 2021: (Start)
For any two terms j and k, the product j*k is also a term (the same property as p^n and smooth numbers).
From a(2) to a(phi(A033845(n))), or a((A033845(n))/3), the terms are the totatives of the A033845(n) itself. (End)
Also orders n for which cyclic and semicyclic diagonal Latin squares exist (see A123565 and A342990). - Eduard I. Vatutin, Jul 11 2023
If k is in the sequence, then k*2^m + 3 is also in the sequence, for all m > 0. - Jules Beauchamp, Aug 29 2024

			G.f. = x + 5*x^2 + 7*x^3 + 11*x^4 + 13*x^5 + 17*x^6 + 19*x^7 + 23*x^8 + ...

K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag, 1980.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Andreas Enge, William Hart, and Fredrik Johansson, Short addition sequences for theta functions, arXiv:1608.06810 [math.NT], 2016-2018.
B. W. J. Irwin, Constants Whose Engel Expansions are the k-rough Numbers.
L. B. W. Jolley, Summation of Series, Dover, 1961
Cedric A. B. Smith, Prime factors and recurring duodecimals, Math. Gaz. 59 (408) (1975) 106-109.
William A. Stein's The Modular Forms Database, PARI-readable dimension tables for Gamma_0(N).
Eric Weisstein's World of Mathematics, Rough Number.
Eric Weisstein's World of Mathematics, Pi Formulas. [_Jaume Oliver Lafont_, Oct 23 2009]
Index entries for sequences related to smooth numbers [_Michael B. Porter_, Oct 09 2009]
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

A005408 \ A016945. Union of A016921 and A016969; union of A038509 and A140475. Essentially the same as A038179. Complement of A047229. Subsequence of A186422.
Cf. A000330, A001580, A002194, A019670, A032528 (partial sums), A038509 (subsequence of composites), A047209, A047336, A047522, A056020, A084967, A090771, A091998, A144065, A175885-A175887.
For k-rough numbers with other values of k, see A000027, A005408, A007775, A008364-A008366, A166061, A166063.
Cf. A126760 (a left inverse).
Row 3 of A260717 (without the initial 1).
Cf. A105397 (first differences).

Filtered([1..150],n->n mod 6=1 or n mod 6=5); # Muniru A Asiru, Dec 19 2018

a007310 n = a007310_list !! (n-1)
a007310_list = 1 : 5 : map (+ 6) a007310_list
-- Reinhard Zumkeller, Jan 07 2012

[n: n in [1..250] | n mod 6 in [1, 5]]; // Vincenzo Librandi, Feb 12 2016

seq(seq(6*i+j,j=[1,5]),i=0..100); # Robert Israel, Sep 08 2014

Select[Range[200], MemberQ[{1, 5}, Mod[#, 6]] &] (* Harvey P. Dale, Aug 27 2013 *)
a[n_] := (6 n + (-1)^n - 3)/2; a[rem156, 60] (* Robert G. Wilson v, May 26 2014 from a suggestion by N. J. A. Sloane *)
Flatten[Table[6n + {1, 5}, {n, 0, 24}]] (* Alonso del Arte, Feb 06 2016 *)
Table[2*Floor[3*n/2] - 1, {n, 1000}] (* Mikk Heidemaa, Feb 11 2016 *)

isA007310(n) = gcd(n,6)==1 \\ Michael B. Porter, Oct 09 2009

A007310(n)=n\2*6-(-1)^n \\ M. F. Hasler, Oct 31 2014

\\ given an element from the sequence, find the next term in the sequence.
nxt(n) = n + 9/2 - (n%6)/2 \\ David A. Corneth, Nov 01 2016

def A007310(n): return (n+(n>>1)<<1)-1 # Chai Wah Wu, Oct 10 2023

[i for i in range(150) if gcd(6,i) == 1] # Zerinvary Lajos, Apr 21 2009

a(n) = (6*n + (-1)^n - 3)/2. - Antonio Esposito, Jan 18 2002
a(n) = a(n-1) + a(n-2) - a(n-3), n >= 4. - Roger L. Bagula
a(n) = 3*n - 1 - (n mod 2). - Zak Seidov, Jan 18 2006
a(1) = 1 then alternatively add 4 and 2. a(1) = 1, a(n) = a(n-1) + 3 + (-1)^n. - Zak Seidov, Mar 25 2006
1 + 1/5^2 + 1/7^2 + 1/11^2 + ... = Pi^2/9 [Jolley]. - Gary W. Adamson, Dec 20 2006
For n >= 3 a(n) = a(n-2) + 6. - Zak Seidov, Apr 18 2007
From R. J. Mathar, May 23 2008: (Start)
Expand (x+x^5)/(1-x^6) = x + x^5 + x^7 + x^11 + x^13 + ...
O.g.f.: x*(1+4*x+x^2)/((1+x)*(1-x)^2). (End)
a(n) = 6*floor(n/2) - 1 + 2*(n mod 2). - Reinhard Zumkeller, Oct 02 2008
1 + 1/5 - 1/7 - 1/11 + + - - ... = Pi/3 = A019670 [Jolley eq (315)]. - Jaume Oliver Lafont, Oct 23 2009
a(n) = ( 6*A062717(n)+1 )^(1/2). - Gary Detlefs, Feb 22 2010
a(n) = 6*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i), with n > 1. - Bruno Berselli, Nov 05 2010
a(n) = 6*n - a(n-1) - 6 for n>1, a(1) = 1. - Vincenzo Librandi, Nov 18 2010
Sum_{n >= 1} (-1)^(n+1)/a(n) = A093766 [Jolley eq (84)]. - R. J. Mathar, Mar 24 2011
a(n) = 6*floor(n/2) + (-1)^(n+1). - Gary Detlefs, Dec 29 2011
a(n) = 3*n + ((n+1) mod 2) - 2. - Gary Detlefs, Jan 08 2012
a(n) = 2*n + 1 + 2*floor((n-2)/2) = 2*n - 1 + 2*floor(n/2), leading to the o.g.f. given by R. J. Mathar above. - Wolfdieter Lang, Jan 20 2012
1 - 1/5 + 1/7 - 1/11 + - ... = Pi*sqrt(3)/6 = A093766 (L. Euler). - Philippe Deléham, Mar 09 2013
1 - 1/5^3 + 1/7^3 - 1/11^3 + - ... = Pi^3*sqrt(3)/54 (L. Euler). - Philippe Deléham, Mar 09 2013
gcd(a(n), 6) = 1. - Reinhard Zumkeller, Nov 14 2013
a(n) = sqrt(6*n*(3*n + (-1)^n - 3)-3*(-1)^n + 5)/sqrt(2). - Alexander R. Povolotsky, May 16 2014
a(n) = 3*n + 6/(9*n mod 6 - 6). - Mikk Heidemaa, Feb 05 2016
From Mikk Heidemaa, Feb 11 2016: (Start)
a(n) = 2*floor(3*n/2) - 1.
a(n) = A047238(n+1) - 1. (suggested by Michel Marcus) (End)
E.g.f.: (2 + (6*x - 3)*exp(x) + exp(-x))/2. - Ilya Gutkovskiy, Jun 18 2016
From Bruno Berselli, Apr 27 2017: (Start)
a(k*n) = k*a(n) + (4*k + (-1)^k - 3)/2 for k>0 and odd n, a(k*n) = k*a(n) + k - 1 for even n. Some special cases:
k=2: a(2*n) = 2*a(n) + 3 for odd n, a(2*n) = 2*a(n) + 1 for even n;
k=3: a(3*n) = 3*a(n) + 4 for odd n, a(3*n) = 3*a(n) + 2 for even n;
k=4: a(4*n) = 4*a(n) + 7 for odd n, a(4*n) = 4*a(n) + 3 for even n;
k=5: a(5*n) = 5*a(n) + 8 for odd n, a(5*n) = 5*a(n) + 4 for even n, etc. (End)
From Antti Karttunen, May 20 2017: (Start)
a(A273669(n)) = 5*a(n) = A084967(n).
a((5*n)-3) = A255413(n).
A126760(a(n)) = n. (End)
a(2*m) = 6*m - 1, m >= 1; a(2*m + 1) = 6*m + 1, m >= 0. - Ralf Steiner, May 17 2018
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = sqrt(3) (A002194).
Product_{n>=2} (1 + (-1)^n/a(n)) = Pi/3 (A019670). (End)

A045943 Triangular matchstick numbers: a(n) = 3n(n+1)/2.

Original entry on oeis.org

0, 3, 9, 18, 30, 45, 63, 84, 108, 135, 165, 198, 234, 273, 315, 360, 408, 459, 513, 570, 630, 693, 759, 828, 900, 975, 1053, 1134, 1218, 1305, 1395, 1488, 1584, 1683, 1785, 1890, 1998, 2109, 2223, 2340, 2460, 2583, 2709, 2838, 2970, 3105, 3243, 3384, 3528

Offset: 0

R. K. Guy

Also, 3 times triangular numbers, a(n) = 3*A000217(n).
In the 24-bit RGB color cube, the number of color-lattice-points in r+g+b = n planes at n < 256 equals the triangular numbers. For n = 256, ..., 765 the number of legitimate color partitions is less than A000217(n) because {r,g,b} components cannot exceed 255. For n = 256, ..., 511, the number of non-color partitions are computable with A045943(n-255), while for n = 512, ..., 765, the number of color points in r+g+b planes equals A000217(765-n). - Labos Elemer, Jun 20 2005
If a 3-set Y and an (n-3)-set Z are disjoint subsets of an n-set X then a(n-3) is the number of 3-subsets of X intersecting both Y and Z. - Milan Janjic, Sep 19 2007
a(n) is also the smallest number that may be written both as the sum of n-1 consecutive positive integers and n consecutive positive integers. - Claudio Meller, Oct 08 2010
For n >= 3, a(n) equals 4^(2+n)*Pi^(1 - n) times the coefficient of zeta(3) in the following integral with upper bound Pi/4 and lower bound 0: int x^(n+1) tan x dx. - John M. Campbell, Jul 17 2011
The difference a(n)-a(n-1) = 3*n, for n >= 1. - Stephen Balaban, Jul 25 2011 [Comment clarified by N. J. A. Sloane, Aug 01 2024]
Sequence found by reading the line from 0, in the direction 0, 3, ..., and the same line from 0, in the direction 0, 9, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. This is one of the orthogonal axes of the spiral; the other is A032528. - Omar E. Pol, Sep 08 2011
A005449(a(n)) = A000332(3n + 3) = C(3n + 3, 4), a second pentagonal number of triangular matchstick number index number. Additionally, a(n) - 2n is a pentagonal number (A000326). - Raphie Frank, Dec 31 2012
Sum of the numbers from n to 2n. - Wesley Ivan Hurt, Nov 24 2015
Number of orbits of Aut(Z^7) as function of the infinity norm (n+1) of the representative integer lattice point of the orbit, when the cardinality of the orbit is equal to 5376 or 17920 or 20160. - Philippe A.J.G. Chevalier, Dec 28 2015
Also the number of 4-cycles in the (n+4)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jul 27 2017
Number of terms less than 10^k, k=0,1,2,3,...: 1, 3, 8, 26, 82, 258, 816, 2582, 8165, 25820, 81650, 258199, 816497, 2581989, 8164966, ... - Muniru A Asiru, Jan 24 2018
Numbers of the form 3*m*(2*m + 1) for m = 0, -1, 1, -2, 2, -3, 3, ... - Bruno Berselli, Feb 26 2018
Partial sums of A008585. - Omar E. Pol, Jun 20 2018
Column 1 of A273464. (Number of ways to select a unit lozenge inside an isosceles triangle of side length n; all vertices on a hexagonal lattice.) - R. J. Mathar, Jul 10 2019
Total number of pips in the n-th suit of a double-n domino set. - Ivan N. Ianakiev, Aug 23 2020

			From _Stephen Balaban_, Jul 25 2011: (Start)
T(n), the triangular numbers = number of nodes,
a(n-1) = number of edges in the T(n) graph:
       o    (T(1) = 1, a(0) = 0)
       o
      / \   (T(2) = 3, a(1) = 3)
     o - o
       o
      / \
     o - o  (T(3) = 6, a(2) = 9)
    / \ / \
   o - o - o
... [Corrected by _N. J. A. Sloane_, Aug 01 2024] (End)

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 543.

Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Abderrahim Arabi, Hacène Belbachir, and Jean-Philippe Dubernard, Enumeration of parallelogram polycubes, arXiv:2105.00971 [cs.DM], 2021.
Francesco Brenti and Paolo Sentinelli, Wachs permutations, Bruhat order and weak order, arXiv:2212.04932 [math.CO], 2022.
Sela Fried, Counting r X s rectangles in nondecreasing and Smirnov words, arXiv:2406.18923 [math.CO], 2024. See p. 5.
Jose Manuel Garcia Calcines, Luis Javier Hernandez Paricio, and Maria Teresa Rivas Rodriguez, Semi-simplicial combinatorics of cyclinders and subdivisions, arXiv:2307.13749 [math.CO], 2023. See p. 29.
T. Aaron Gulliver, Sums of Powers of Integers Divisible by Three, Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 38, 1895 - 1901.
Alfred Hoehn, Illustration of initial terms of A000326, A005449, A045943, A115067
Milan Janjic, Two Enumerative Functions
Milan Janjic and Boris Petkovic, A Counting Function, arXiv preprint arXiv:1301.4550 [math.CO], 2013.
Milan Janjic and Boris Petkovic, A Counting Function Generalizing Binomial Coefficients and Some Other Classes of Integers, J. Int. Seq. 17 (2014) # 14.3.5.
E. Lábos, On the number of RGB-colors we can distinguish. Partition Spectra. Lecture at 7th Hungarian Conference on Biometry and Biomathematics. Budapest. Jul 06, 2005. Applied Ecology and Environmental Research 4(2): 159-169, 2006.
R. J. Mathar, Lozenge tilings of the equilateral triangle, arXiv:1909.06336 [math.CO], 2019.
Eric Weisstein's World of Mathematics, Graph Cycle.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A005448, A002378, A046092, A051162, A126804, A001318, A032528.
3 times n-gonal numbers: A033428, A062741, A094159, A152773, A152751, A152759, A152767, A153783, A153448, A153875.
The generalized pentagonal numbers b*n+3*n*(n-1)/2, for b = 1 through 12, form sequences A000326, A005449, A045943, A115067, A140090, A140091, A059845, A140672, A140673, A140674, A140675, A151542.
A diagonal of A010027.
Orbits of Aut(Z^7) as function of the infinity norm A000579, A154286, A102860, A002412, A115067, A008585, A005843, A001477, A000217.
Cf. A027480 (partial sums).
Cf. A002378 (3-cycles in triangular honeycomb acute knight graph), A028896 (5-cycles), A152773 (6-cycles).
This sequence: Sum_{k = n..2*n} k.
Cf. A304993:   Sum_{k = n..2*n} k*(k+1)/2.
Cf. A050409:   Sum_{k = n..2*n} k^2.
Similar sequences are listed in A316466.

List([0..10^4], n -> 3*n*(n+1)/2); # Muniru A Asiru, Jan 24 2018

a n = sum [x | x <- [n..2*n]] -- Peter Kagey, Jul 27 2015

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

seq(3*binomial(n+1,2), n=0..49); # Zerinvary Lajos, Nov 24 2006

Table[3 n (n + 1)/2, {n, 0, 50}] (* Vladimir Joseph Stephan Orlovsky, Oct 31 2008 *)
3 Accumulate@Range[0, 48] (* Arkadiusz Wesolowski, Oct 29 2012 *)
CoefficientList[Series[-3 x/(x - 1)^3, {x, 0, 47}], x] (* Robert G. Wilson v, Jan 29 2015 *)
LinearRecurrence[{3, -3, 1}, {0, 3, 9}, 50] (* Jean-François Alcover, Dec 12 2016 *)

a(n)=3*binomial(n+1,2) \\ Charles R Greathouse IV, Jun 16 2011

(3 to 150 by 3).scanLeft(0)( + ) // Alonso del Arte, Sep 12 2019

a(n) is the sum of n+1 integers starting from n, i.e., 1+2, 2+3+4, 3+4+5+6, 4+5+6+7+8, etc. - Jon Perry, Jan 15 2004
a(n) = A126890(n+1,n-1) for n>1. - Reinhard Zumkeller, Dec 30 2006
a(n) + A145919(3*n+3) = 0. - Matthew Vandermast, Oct 28 2008
a(n) = A000217(2*n) - A000217(n-1); A179213(n) <= a(n). - Reinhard Zumkeller, Jul 05 2010
a(n) = a(n-1)+3*n, n>0. - Vincenzo Librandi, Nov 18 2010
G.f.: 3*x/(1-x)^3. - Bruno Berselli, Jan 21 2011
a(n) = A005448(n+1) - 1. - Omar E. Pol, Oct 03 2011
a(n) = A001477(n)+A000290(n)+A000217(n). - J. M. Bergot, Dec 08 2012
a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) for n>2. - Wesley Ivan Hurt, Nov 24 2015
a(n) = A027480(n)-A027480(n-1). - Peter M. Chema, Jan 18 2017.
2*a(n)+1 = A003215(n). - Miquel Cerda, Jan 22 2018
a(n) = T(2*n) - T(n-1), where T(n) = A000217(n). In general, T(k)*T(n) = Sum_{i=0..k-1} (-1)^i*T((k-i)*(n-i)). - Charlie Marion, Dec 06 2020
E.g.f.: 3*exp(x)*x*(2 + x)/2. - Stefano Spezia, May 19 2021
From Amiram Eldar, Jan 10 2022: (Start)
Sum_{n>=1} 1/a(n) = 2/3.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*(2*log(2)-1)/3. (End)
Product_{n>=1} (1 - 1/a(n)) = -(3/(2*Pi))*cos(sqrt(11/3)*Pi/2). - Amiram Eldar, Feb 21 2023

A007590 a(n) = floor(n^2/2).

Original entry on oeis.org

0, 0, 2, 4, 8, 12, 18, 24, 32, 40, 50, 60, 72, 84, 98, 112, 128, 144, 162, 180, 200, 220, 242, 264, 288, 312, 338, 364, 392, 420, 450, 480, 512, 544, 578, 612, 648, 684, 722, 760, 800, 840, 882, 924, 968, 1012, 1058, 1104, 1152, 1200, 1250, 1300, 1352, 1404

Offset: 0

N. J. A. Sloane, R. K. Guy

Arithmetic mean of a pair of successive triangular numbers. - Amarnath Murthy, Jul 24 2005
Maximum sum of absolute differences of cyclically adjacent elements in a permutation of (1..n). For example, with n = 9, permutation (1,9,2,8,3,7,4,6,5) has adjacent differences (8,7,6,5,4,3,2,1,4) with maximal sum a(9) = 40. - Joshua Zucker, Dec 15 2005
a(n) = maximum number of non-overlapping 1 X 2 rectangles that can be packed into an n X n square. Rectangles can only be placed parallel to the sides of the square. Verified with Lobato's tool, see links. - Dmitry Kamenetsky, Aug 03 2009 [This is easily provable - David W. Wilson, Jan 25 2014]
Number of strictly increasing arrangements of 3 nonzero numbers in -(n+1)..(n+1) with sum zero. For example, a(2) = 2 has two solutions: (-3, 1, 2) and (-2, -1, 3) each add to zero. - Michael Somos, Apr 11 2011
For n >= 4 is a(n) the minimal value v such that v = Sum_{i in S1} i = Product_{j in S2} j with disjoint union of S1, S2 = {1, 2, ..., n+1}. Example: a(4) = 8 = 3+5 = 1*2*4. - Claudio Meller, May 27 2012
Sum_{n > 1} 1/a(n) = (zeta(2) + 1)/2. - Enrique Pérez Herrero, Jun 19 2013
Apart from the initial term this is the elliptic troublemaker sequence R_n(2,4) in the notation of Stange (see Table 1, p. 16). For other elliptic troublemaker sequences R_n(a,b) see the cross references below. - Peter Bala, Aug 12 2013
Maximum sum of displacements of elements in a permutation of (1..n). For example, with n = 9, permutation (5,6,7,8,9,1,2,3,4) has displacements (4,4,4,4,4,5,5,5,5) with maximal sum a(9) = 40. - David W. Wilson, Jan 25 2014
A245575(a(n)) mod 2 = 1, or for n > 0, where odd terms occur in A245575. - Reinhard Zumkeller, Aug 05 2014
Also the matching number of the n X n king, rook, and rook complement graphs. - Eric W. Weisstein, Jun 20 and Sep 14 2017
For n > 1, also the vertex count of the n X n white bishop graph. - Eric W. Weisstein, Jun 27 2017
This is also the number of distinct ways n^2 can be represented as the sum of two positive integers. - William Boyles, Jan 15 2018
Also the crossing number of the complete bipartite graph K_{4,n+1}. - Eric W. Weisstein, Sep 11 2018
The sequence can be obtained from A033429 by deleting the last digit of each term. - Bruno Berselli, Sep 11 2019
Starting at n=2, the number of facets of the n-dimensional Kunz cone C_(n+1). - Emily O'Sullivan, Jul 08 2023

			a(3) = 4 because 3^2/2 = 9/2 = 4.5 and floor(4.5) = 4.
a(4) = 8 because 4^2/2 = 16/2 = 8.
a(5) = 12 because 5^2/2 = 25/2 = 12.5 and floor(12.5) = 12.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..1000
Laurent Bulteau, Samuele Giraudo and Stéphane Vialette, Disorders and permutations , 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). Article No. 18; pp. 18:1-18:14.
Bakir Farhi, On the Representation of the Natural Numbers as the Sum of Three Terms of the Sequence floor(n^2/a), Journal of Integer Sequences, Vol. 16 (2013), Article 13.6.4.
Richard K. Guy, Letters to N. J. A. Sloane, June-August 1968.
R. D. Lobato, Recursive partitioning approach for the Manufacturer's Pallet Loading Problem.
Emily O'Sullivan, Understanding the face structure of the Kunz cone, Master's thesis, San Diego State Univ., 2023.
K. E. Stange, Integral points on elliptic curves and explicit valuations of division polynomials arXiv:1108.3051 [math.NT], 2011-2014.
Eric Weisstein's World of Mathematics, Complete Bipartite Graph.
Eric Weisstein's World of Mathematics, Graph Crossing Number.
Eric Weisstein's World of Mathematics, Matching Number.
Eric Weisstein's World of Mathematics, King Graph.
Eric Weisstein's World of Mathematics, Rook Complement Graph.
Eric Weisstein's World of Mathematics, Rook Graph.
Eric Weisstein's World of Mathematics, Vertex Count.
Eric Weisstein's World of Mathematics, White Bishop Graph.
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Column 3 of triangle A094953.
For n > 2: a(n) = sum of (n-1)-th row in triangle A101037.
Cf. A000212, A000290, A056827, A118013, A118015.
A080476 is essentially the same sequence.
Cf. A000982.
Elliptic troublemaker sequences: A000212 (= R_n(1,3) = R_n(2,3)), A002620 (= R_n(1,2)), A030511 (= R_n(2,6) = R_n(4,6)), A033436 (= R_n(1,4) = R_n(3,4)), A033437 (= R_n(1,5) = R_n(4,5)), A033438 (= R_n(1,6) = R_n(5,6)), A033439 (= R_n(1,7) = R_n(6,7)), A184535 (= R_n(2,5) = R_n(3,5)).
Cf. A182834 (complement), A245575.
First differences: A052928(n+1), is first differences of A212964; partial sums: A212964(n+1), is partial sums of A052928. - Guenther Schrack, Dec 10 2017
Cf. A033429 (5*n^2).
Cf. A056834, A130519, A056838, A056865.

a007550 = flip div 2 . (^ 2)  -- Reinhard Zumkeller, Aug 05 2014

a007590 = 0 : 0 : 0 : [ a1 + a2 - a3 + 2 | (a1, a2, a3) <- zip3 (tail (tail a007590)) (tail a007590) a007590 ] -- Luc Duponcheel, Sep 30 2020

[Floor(n^2/2): n in [0..53]]; // Bruno Berselli, Mar 28 2011

[Binomial(n,2)+Floor(n/2): n in [0..60]]; // Bruno Berselli, Jun 08 2017

A007590:=n->floor(n^2/2); seq(A007590(k), k=0..100); # Wesley Ivan Hurt, Oct 29 2013

Floor[Range[0, 53]^2/2] (* Alonso del Arte, Aug 07 2013 *)
Table[Binomial[n, 2] + Floor[n/2], {n, 0, 60}] (* Bruno Berselli, Jun 08 2017 *)
LinearRecurrence[{2, 0, -2, 1}, {0, 2, 4, 8}, 20] (* Eric W. Weisstein, Sep 14 2017 *)
CoefficientList[Series[-2 x/((-1 + x)^3 (1 + x)), {x, 0, 20}], x] (* Eric W. Weisstein, Sep 14 2017 *)
Table[Floor[n^2/2], {n, 0, 20}] (* Eric W. Weisstein, Sep 11 2018 *)

PARI
```
{a(n) = n^2 \ 2}
```

{a(n) = local(v, c, m); m = n+1; forvec( v = vector( 3, i, [-m, m]), if( 0==prod( k=1, 3, v[k]), next); if( 0==sum( k=1, 3, v[k]), c++), 2); c} /* Michael Somos, Apr 11 2011 */

first(n) = Vec(2*x^2/((1+x)*(1-x)^3) + O(x^n), -n); \\ Iain Fox, Dec 11 2017

def A007590(n): return n**2//2 # Chai Wah Wu, Jun 07 2022

a(n) = a(n-1) + a(n-2) - a(n-3) + 2 = 2*A002620(n) = A000217(n+1) + A004526(n). - Henry Bottomley, Mar 08 2000
a(n+1) = Sum_{k=1..n} (k + (k mod 2)). Therefore a(n) = Sum_{k=1..n} 2*floor(k/2). - William A. Tedeschi, Mar 19 2008
From R. J. Mathar, Nov 22 2008: (Start)
G.f.: 2*x^2/((1+x)*(1-x)^3).
a(n+1) - a(n) = A052928(n+1). (End)
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4). - R. H. Hardin, Mar 28 2011
a(n) = (2*n^2 + (-1)^n - 1)/4. - Bruno Berselli, Mar 28 2011
a(n) = ceiling((n^2-1)/2) = binomial(n+1, 2) - ceiling(n/2). - Wesley Ivan Hurt, Mar 08 2014, Jun 14 2013
a(n+1) = A014105(n) - A032528(n). - Richard R. Forberg, Aug 07 2013
a(n) = binomial(n,2) + floor(n/2). - Bruno Berselli, Jun 08 2017
a(n) = A099392(n+1) - 1. - Guenther Schrack, Dec 10 2017
E.g.f.: (x*(x + 1)*cosh(x) + (x^2 + x - 1)*sinh(x))/2. - Stefano Spezia, May 06 2021
From Amiram Eldar, Mar 20 2022: (Start)
Sum_{n>=2} 1/a(n) = Pi^2/12 + 1/2.
Sum_{n>=2} (-1)^n/a(n) = Pi^2/12 - 1/2. (End)

Edited by Charles R Greathouse IV, Apr 20 2010

A003154 Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6k(k-1) + 1.

Original entry on oeis.org

1, 13, 37, 73, 121, 181, 253, 337, 433, 541, 661, 793, 937, 1093, 1261, 1441, 1633, 1837, 2053, 2281, 2521, 2773, 3037, 3313, 3601, 3901, 4213, 4537, 4873, 5221, 5581, 5953, 6337, 6733, 7141, 7561, 7993, 8437, 8893, 9361, 9841, 10333, 10837, 11353, 11881, 12421

Offset: 1

N. J. A. Sloane

Binomial transform of [1, 12, 12, 0, 0, 0, ...]. Narayana transform (A001263) of [1, 12, 0, 0, 0, ...]. - Gary W. Adamson, Dec 29 2007
Numbers k such that 6*k+3 is a square, these squares are given in A016946. - Gary Detlefs and Vincenzo Librandi, Aug 08 2010
Odd numbers of the form floor(n^2/6). - Juri-Stepan Gerasimov, Jul 27 2011
Bisection of A032528. - Omar E. Pol, Aug 20 2011
Sequence found by reading the line from 1, in the direction 1, 13, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. Opposite numbers to the members of A033581 in the same spiral. - Omar E. Pol, Sep 08 2011
The digital root has period 3 (1, 4, 1) (A146325), the same digital root as the centered triangular numbers A005448(n). - Peter M. Chema, Dec 20 2023

			From _Omar E. Pol_, Aug 21 2011: (Start)
1. Classic illustration of initial terms of the star numbers:
.
.                                     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            13                 37
.
2. Alternative illustration of initial terms using n-1 concentric hexagons around a central element:
.
.                                 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
(End)

Martin Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 20.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..1000
John Elias, Illustration: Star Configurations on the Zero-Centered Hexagonal Number Spiral.
John Elias, Illustration: Star Configurations on the Zero-Centered Square and Hexagonal Number Spirals.
John Elias, Illustration: Generalized Pentagonal and Octagonal Numbers in the Star-Crossed Configurations.
John Elias, Illustration: Generalized Pentagonal and Octagonal Integration in Centered 9-gonal Triangles.
Martin Gardner and N. J. A. Sloane, Correspondence, 1973-74.
Marco Matone and Roberto Volpato, Vector-Valued Modular Forms from the Mumford Form, Schottky-Igusa Form, Product of Thetanullwerte and the Amazing Klein Formula, arXiv:1102.0006 [math.AG], 2011-2012, c_n.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Amelia C. Sparavigna, Groupoid of OEIS A003154 numbers (star numbers or centered dodecagonal numbers), Politecnico di Torino, Repository istituzionale (2019).
Amelia Carolina Sparavigna, Groupoid of OEIS A003154 Numbers (star numbers or centered dodecagonal numbers), Department of Applied Science and Technology, Politecnico di Torino (Italy, 2019).
Amelia Carolina Sparavigna, Generalized Sum of Stella Octangula Numbers, Politecnico di Torino (Italy, 2021).
Leo Tavares, Illustration: Twin Hexagons.
Leo Tavares, Illustration: Diamond Rays.
Eric Weisstein's World of Mathematics, Star Number.
R. Yin, J. Mu, and T. Komatsu, The p-Frobenius Number for the Triple of the Generalized Star Numbers, Preprints 2024, 2024072280. See p. 1.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
Index entries for sequences related to centered polygonal numbers.

Cf. A001263, A001318, A003215, A007588, A016946, A032528, A033581, A049598, A056827, A306980.
Row 4 of A257565.
Cf. A000217, A005448, A016754, A146325.

List([1..50], n-> 12*Binomial(n,2)+1 ); # G. C. Greubel, Jul 23 2019

([: >: 6 * ] * <:) i.1000 NB. Stephen Makdisi, May 06 2018

[12*Binomial(n,2)+1: n in [1..50]]; // G. C. Greubel, Jul 23 2019

A003154:=n->6*n*(n-1) + 1: seq(A003154(n), n=1..100); # Wesley Ivan Hurt, Oct 23 2017

FoldList[#1 + #2 &, 1, 12 Range@50] (* Robert G. Wilson v *)
LinearRecurrence[{3,-3,1},{1,13,37},50] (* Harvey P. Dale, Jul 18 2016 *)
12*Binomial[Range[50], 2] + 1 (* G. C. Greubel, Jul 23 2019 *)

a(n)=6*n*(n-1)+1 \\ Charles R Greathouse IV, Nov 20 2012

print([6*n*(n-1)+1 for n in range(1, 47)]) # Michael S. Branicky, Jan 13 2021

G.f.: x*(1+10*x+x^2)/(1-x)^3. Simon Plouffe in his 1992 dissertation
a(n) = 1 + Sum_{j=0..n} (12*j). E.g., a(2)=37 because 1 + 12*0 + 12*1 + 12*2 = 37. - Xavier Acloque, Oct 06 2003
a(n) = numerator in B_2(x) = (1/2)x^2 - (1/2)x + 1/12 = Bernoulli polynomial of degree 2. - Gary W. Adamson, May 30 2005
a(n) = 12*(n-1) + a(n-1), with n>1, a(1)=1. - Vincenzo Librandi, Aug 08 2010
a(n) = A049598(n-1) + 1. - Omar E. Pol, Oct 03 2011
Sum_{n>=1} 1/a(n) = A306980 = Pi * tan(Pi/(2*sqrt(3))) / (2*sqrt(3)). - Vaclav Kotesovec, Jul 23 2019
From Amiram Eldar, Jun 21 2020: (Start)
Sum_{n>=1} a(n)/n! = 7*e - 1.
Sum_{n>=1} (-1)^n * a(n)/n! = 7/e - 1. (End)
a(n) = 2*A003215(n-1) - 1. - Leo Tavares, Jul 30 2021
E.g.f.: exp(x)*(1 + 6*x^2) - 1. - Stefano Spezia, Aug 19 2022

More terms from Michael Somos

A033581 a(n) = 6*n^2.

Original entry on oeis.org

0, 6, 24, 54, 96, 150, 216, 294, 384, 486, 600, 726, 864, 1014, 1176, 1350, 1536, 1734, 1944, 2166, 2400, 2646, 2904, 3174, 3456, 3750, 4056, 4374, 4704, 5046, 5400, 5766, 6144, 6534, 6936, 7350, 7776, 8214, 8664, 9126, 9600, 10086, 10584, 11094, 11616

Offset: 0

N. J. A. Sloane

Number of edges of a complete 4-partite graph of order 4n, K_n,n,n,n. - Roberto E. Martinez II, Oct 18 2001
Number of edges of the complete bipartite graph of order 7n, K_n, 6n. - Roberto E. Martinez II, Jan 07 2002
Number of edges in the line graph of the product of two cycle graphs, each of order n, L(C_n x C_n). - Roberto E. Martinez II, Jan 07 2002
Total surface area of a cube of edge length n. See A000578 for cube volume. See A070169 and A071399 for surface area and volume of a regular tetrahedron and links for the other Platonic solids. - Rick L. Shepherd, Apr 24 2002
a(n) can represented as n concentric hexagons (see example). - Omar E. Pol, Aug 21 2011
Sequence found by reading the line from 0, in the direction 0, 6, ..., in the square spiral whose vertices are the generalized pentagonal numbers A001318. Opposite numbers to the members of A003154 in the same spiral. - Omar E. Pol, Sep 08 2011
Together with 1, numbers m such that floor(2*m/3) and floor(3*m/2) are both squares. Example: floor(2*150/3) = 100 and floor(3*150/2) = 225 are both squares, so 150 is in the sequence. - Bruno Berselli, Sep 15 2014
a(n+1) gives the number of vertices in a hexagon-like honeycomb built from A003215(n) congruent regular hexagons (see link). Example: a hexagon-like honeycomb consisting of 7 congruent regular hexagons has 1 core hexagon inside a perimeter of six hexagons. The perimeter has 18 vertices. The core hexagon has 6 vertices. a(2) = 18 + 6 = 24 is the total number of vertices. - Ivan N. Ianakiev, Mar 11 2015
a(n) is the area of the Pythagorean triangle whose sides are (3n, 4n, 5n). - Sergey Pavlov, Mar 31 2017
More generally, if k >= 5 we have that the sequence whose formula is a(n) = (2*k - 4)*n^2 is also the sequence found by reading the line from 0, in the direction 0, (2*k - 4), ..., in the square spiral whose vertices are the generalized k-gonal numbers. In this case k = 5. - Omar E. Pol, May 13 2018
The sequence also gives the number of size=1 triangles within a match-made hexagon of size n. - John King, Mar 31 2019
For hexagons, the number of matches required is A045945; thus number of size=1 triangles is A033581; number of larger triangles is A307253 and total number of triangles is A045949. See A045943 for analogs for Triangles; see A045946 for analogs for Stars. - John King, Apr 04 2019

			From _Omar E. Pol_, Aug 21 2011: (Start)
Illustration of initial terms as concentric hexagons:
.
.                                 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
.                                 o o o o o o
.
.    6            24                   54
.
(End)

Nathaniel Johnston, Table of n, a(n) for n = 0..10000
Bruno Berselli, An interpretation of initial terms.
Ivan N. Ianakiev, Hexagon-like honeycomb built form regular congruent hexagons.
Leo Tavares, Illustration: Diamond Star Rays
Eric Weisstein's World of Mathematics, Platonic Solid.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Bisection of A032528. Central column of triangle A001283.
Cf. A000217, A000290, A001105, A009111, A033428, A033583, A085250, A086729, A152734, A152751.
Cf. A000578, A001318, A003215, A005897, A045943, A045945, A045949, A070169, A071399.
Cf. A017593 (first differences).

a033581 = (* 6) . (^ 2)  -- Reinhard Zumkeller, Apr 27 2014

seq(6*n^2,n=0..44); # Nathaniel Johnston, Jun 26 2011

6 Range[44]^2 (* Michael De Vlieger, Apr 02 2017 *)
LinearRecurrence[{3,-3,1},{0,6,24},50] (* Harvey P. Dale, Jul 03 2017 *)

vector(100,n,6*(n-1)^2) \\ Derek Orr, Mar 11 2015

a(n) = A000290(n)*6. - Omar E. Pol, Dec 11 2008
a(n) = A001105(n)*3 = A033428(n)*2. - Omar E. Pol, Dec 13 2008
a(n) = 12*n + a(n-1) - 6, with a(0)=0. - Vincenzo Librandi, Aug 05 2010
G.f.: 6*x*(1+x)/(1-x)^3. - Colin Barker, Feb 14 2012
For n > 0: a(n) = A005897(n) - 2. - Reinhard Zumkeller, Apr 27 2014
a(n) = 3*floor(1/(1-cos(1/n))) = floor(1/(1-n*sin(1/n))) for n > 0. - Clark Kimberling, Oct 08 2014
a(n) = t(4*n) - 4*t(n), where t(i) = i*(i+k)/2 for any k. Special case (k=1): a(n) = A000217(4*n) - 4*A000217(n). - Bruno Berselli, Aug 31 2017
From Amiram Eldar, Feb 03 2021: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/36.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/72 (A086729).
Product_{n>=1} (1 + 1/a(n)) = sqrt(6)*sinh(Pi/sqrt(6))/Pi.
Product_{n>=1} (1 - 1/a(n)) = sqrt(6)*sin(Pi/sqrt(6))/Pi. (End)
E.g.f.: 6*exp(x)*x*(1 + x). - Stefano Spezia, Aug 19 2022

More terms from Larry Reeves (larryr(AT)acm.org), Nov 08 2001

A008458 Coordination sequence for hexagonal lattice.

Original entry on oeis.org

1, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 96, 102, 108, 114, 120, 126, 132, 138, 144, 150, 156, 162, 168, 174, 180, 186, 192, 198, 204, 210, 216, 222, 228, 234, 240, 246, 252, 258, 264, 270, 276, 282, 288, 294, 300, 306, 312, 318, 324, 330, 336, 342, 348

Offset: 0

N. J. A. Sloane

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice. It is also the planar net 3.3.3.3.3.3.
Coordination sequence for 2-dimensional cyclotomic lattice Z[zeta_6].
Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 20 ).
Also the Engel expansion of exp^(1/6); cf. A006784 for the Engel expansion definition. - Benoit Cloitre, Mar 03 2002
Numbers k such that k+floor(k/2) | k*floor(k/2). - Wesley Ivan Hurt, Dec 01 2020

			From _Omar E. Pol_, Aug 20 2011: (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
. 1             o o o       o       o       o           o
.       6                    o o o o         o         o
.                 12                          o o o o o
.                               18
.                                                 24
(End)
G.f. = 1 + 6*x + 12*x^2 + 18*x^3 + 24*x^4 + 30*x^5 + 36*x^6 + 42*x^7 + 48*x^8 + 54*x^9 + ...

T. D. Noe, Table of n, a(n) for n = 0..1000
M. Beck and S. Hosten, Cyclotomic polytopes and growth series of cyclotomic lattices, arXiv:math/0508136 [math.CO], 2005-2006.
J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389 (pdf).
Brian Galebach, k-uniform tilings (k <= 6) and their A-numbers
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also on arXiv, arXiv:1803.08530 [math.CO], 2018-2019.
Rostislav Grigorchuk and Cosmas Kravaris, On the growth of the wallpaper groups, arXiv:2012.13661 [math.GR], 2020. See section 4.1 p. 19.
Branko Grünbaum and Geoffrey C. Shephard, Tilings by regular polygons, Mathematics Magazine, 50 (1977), 227-247.
Tom Karzes, Tiling Coordination Sequences
G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2
Reticular Chemistry Structure Resource, hxl
N. J. A. Sloane, The uniform planar nets and their A-numbers [Annotated scanned figure from Gruenbaum and Shephard (1977)]
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N))
William A. Stein, The modular forms database
Index entries for sequences related to A2 = hexagonal = triangular lattice
Index entries for linear recurrences with constant coefficients, signature (2,-1).
Index entries for coordination sequences

Essentially the same as A008588.
List of coordination sequences for uniform planar nets: A008458 (the planar net 3.3.3.3.3.3), A008486 (6^3), A008574(4.4.4.4 and 3.4.6.4), A008576 (4.8.8), A008579(3.6.3.6), A008706 (3.3.3.4.4), A072154 (4.6.12), A219529(3.3.4.3.4), A250120 (3.3.3.3.6), A250122 (3.12.12).
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.
Cf. A032528. - Omar E. Pol, Aug 20 2011
Cf. A048477 (binomial Transf.)

[0^n+6*n: n in [0..60] ]; // Vincenzo Librandi, Aug 21 2011

Maple
```
1, seq(6*n, n=1..65);
```

Join[{1},6*Range[60]] (* Harvey P. Dale, Jul 21 2013 *)
a[ n_] := Boole[n == 0] + 6 n; (* Michael Somos, May 21 2015 *)

makelist(if n=0 then 1 else 6*n,n,0,65); /* Martin Ettl, Nov 12 2012 */

PARI
```
{a(n) = 6*n + (!n)};
```

[6*n+int(n==0) for n in range(66)] # G. C. Greubel, May 25 2023

G.f.: (1 + 4*x + x^2)/(1 - x)^2.
a(n) = A003215(n) - A003215(n-1), n > 0.
Equals binomial transform of [1, 5, 1, -1, 1, -1, 1, ...]. - Gary W. Adamson, Jul 08 2008
G.f.: Hypergeometric2F1([3,-2], [1], -x/(1-x)). - Paul Barry, Sep 18 2008
a(n) = 0^n + 6*n. - Vincenzo Librandi, Aug 21 2011
n*a(1) + (n-1)*a(2) + (n-2)*a(3) + ... + 2*a(n-1) + a(n) = n^3. - Warren Breslow, Oct 28 2013
E.g.f.: 1 + 6*x*exp(x). - Stefano Spezia, Jun 26 2022

A001079 a(n) = 10*a(n-1) - a(n-2); a(0) = 1, a(1) = 5.

Original entry on oeis.org

1, 5, 49, 485, 4801, 47525, 470449, 4656965, 46099201, 456335045, 4517251249, 44716177445, 442644523201, 4381729054565, 43374646022449, 429364731169925, 4250272665676801, 42073361925598085, 416483346590304049

Offset: 0

N. J. A. Sloane

Also gives solutions to the equation x^2-1=floor(x*r*floor(x/r)) where r=sqrt(6). - Benoit Cloitre, Feb 14 2004
Appears to give all solutions >1 to the equation x^2=ceiling(x*r*floor(x/r)) where r=sqrt(6). - Benoit Cloitre, Feb 24 2004
a(n) and b(n) (A004189) are the nonnegative proper solutions to the Pell equation a(n)^2 - 6*(2*b(n))^2 = +1, n >= 0. The formula given below by Gregory V. Richardson follows. - Wolfdieter Lang, Jun 26 2013
a(n) are the integer square roots of (A032528 + 1). They are also the values of m where (A032528(m) - 1) has integer square roots. See A122653 for the integer square roots of (A032528 - 1), and see A122652 for the values of m where (A032528(m) + 1) has integer square roots. - Richard R. Forberg, Aug 05 2013
a(n) are also the values of m where floor(2m^2/3) has integer square roots, excluding m = 0. The corresponding integer square roots are given by A122652(n). - Richard R. Forberg, Nov 21 2013
Except for the first term, positive values of x (or y) satisfying x^2 - 10xy + y^2 + 24 = 0. - Colin Barker, Feb 09 2014
Dickson on page 384 gives the Diophantine equation "24x^2 + 1 = y^2" and later states "y_{n+1} = 10y_n - y_{n-1}" where y_n is this sequence. - Michael Somos, Jun 19 2023

			Pell equation: n = 0: 1^2 - 24*0^2 = +1, n = 1: 5^2 - 6*(1*2)^2 = 1, n = 2: 49^2 - 6*(2*10)^2 = +1. - _Wolfdieter Lang_, Jun 26 2013
G.f. = 1 + 5*x + 49*x^2 + 485*x^3 + 4801*x^4 + 47525*x^5 + 470449*x^6 + ...

Bastida, Julio R. Quadratic properties of a linearly recurrent sequence. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 163-166, Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man., 1979. MR0561042 (81e:10009) - From N. J. A. Sloane, May 30 2012
L. E. Dickson, History of the Theory of Numbers, Vol. II, Diophantine Analysis. AMS Chelsea Publishing, Providence, Rhode Island, 1999, p. 384.
L. Euler, (E388) Vollstaendige Anleitung zur Algebra, Zweiter Theil, reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 1, p. 374.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
V. Thébault, Les Récréations Mathématiques. Gauthier-Villars, Paris, 1952, p. 281.

T. D. Noe, Table of n, a(n) for n=0..200
Hacène Belbachir, Soumeya Merwa Tebtoub, and László Németh, Ellipse Chains and Associated Sequences, J. Int. Seq., Vol. 23 (2020), Article 20.8.5.
John M. Campbell, An Integral Representation of Kekulé Numbers, and Double Integrals Related to Smarandache Sequences, arXiv preprint arXiv:1105.3399 [math.GM], 2011.
Leonhard Euler, Vollstaendige Anleitung zur Algebra, Zweiter Teil.
Leonhard Euler, De solutione problematum diophanteorum per numeros integros, par. 18.
Tanya Khovanova, Recursive Sequences
Robert Phillips, Polynomials of the form 1+4ke+4ke^2, 2008.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Index entries for linear recurrences with constant coefficients, signature (10,-1).
Index entries for sequences related to Chebyshev polynomials.

Cf. A004189, A001078, A046173, A046172, A036353, A138281, A004189.

I:=[1,5]; [n le 2 select I[n] else 10*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Sep 10 2016

A001079 := proc(n)
    option remember;
    if n <= 1 then
        op(n+1,[1,5]) ;
    else
        10*procname(n-1)-procname(n-2) ;
    end if;
end proc:
seq(A001079(n),n=0..20) ; # R. J. Mathar, Apr 30 2017

Table[(-1)^n Round[N[Cos[2 n ArcSin[Sqrt[3]]], 50]], {n, 0, 20}] (* Artur Jasinski, Oct 29 2008 *)
a[ n_] := ChebyshevT[n, 5]; (* Michael Somos, Aug 24 2014 *)
CoefficientList[Series[(1-5*x)/(1-10*x+x^2), {x, 0, 50}], x] (* G. C. Greubel, Dec 20 2017 *)
a[n_] := 3^n*Sum[(2/3)^k*Binomial[2*n, 2*k], {k,0,n}]; Flatten[Table[a[n], {n,0,18}]] (* Detlef Meya, May 21 2024 *)

{a(n) = subst(poltchebi(n), 'x, 5)}; /* Michael Somos, Sep 05 2006 */

{a(n) = real((5 + 2*quadgen(24))^n)}; /* Michael Somos, Sep 05 2006 */

{a(n) = n = abs(n); polsym(1 - 10*x + x^2, n)[n+1] / 2}; /* Michael Somos, Sep 05 2006 */

x='x+O('x^30); Vec((1-5*x)/(1-10*x+x^2)) \\ G. C. Greubel, Dec 20 2017

For all members x of the sequence, 6*x^2 -6 is a square. Limit_{n->infinity} a(n)/a(n-1) = 5 + 2*sqrt(6). - Gregory V. Richardson, Oct 13 2002
a(n) = T(n, 5) = (S(n, 10)-S(n-2, 10))/2 with S(n, x) := U(n, x/2) and T(n), resp. U(n, x), are Chebyshev's polynomials of the first, resp. second, kind. See A053120 and A049310. S(n, 10) = A004189(n+1).
a(n) = sqrt(1+24*A004189(n)^2) (cf. Richardson comment).
a(n)*a(n+3) - a(n+1)*a(n+2) = 240. - Ralf Stephan, Jun 06 2005
Chebyshev's polynomials T(n,x) evaluated at x=5.
G.f.: (1-5*x)/(1-10*x+x^2). - Simon Plouffe in his 1992 dissertation
a(n)= ((5+2*sqrt(6))^n + (5-2*sqrt(6))^n)/2.
a(-n) = a(n).
a(n+1) = 5*a(n) + 2*(6*a(n)^2-6)^(1/2) - Richard Choulet, Sep 19 2007
(sqrt(2)+sqrt(3))^(2*n)=a(n)+A001078(n)*sqrt(6). - Reinhard Zumkeller, Mar 12 2008
a(n+1) = 2*A054320(n) + 3*A138288(n). - Reinhard Zumkeller, Mar 12 2008
a(n) = cosh(2*n* arcsinh(sqrt(2))). - Herbert Kociemba, Apr 24 2008
a(n) = (-1)^n * cos(2*n* arcsin(sqrt(3))). - Artur Jasinski, Oct 29 2008
a(n) = cos(2*n* arccos(sqrt(3))). - Artur Jasinski, Sep 10 2016
a(n) = A142238(2n-1) = A041006(2n-1) = A041038(2n-1), for all n > 0. - M. F. Hasler, Feb 14 2009
2*a(n)^2 = 3*A122652(n)^2 + 2. - Charlie Marion, Feb 01 2013
E.g.f.: cosh(2*sqrt(6)*x)*exp(5*x). - Ilya Gutkovskiy, Sep 10 2016
From Peter Bala, Aug 17 2022: (Start)
a(n) = (1/2)^n * [x^n] ( 10*x + sqrt(1 + 96*x^2) )^n.
The g.f. A(x) satisfies A(2*x) = 1 + x*B'(x)/B(x), where B(x) = 1/sqrt(1 - 20*x + 4*x^2) is the g.f. of A098270.
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p >= 3 and positive integers n and k.
Sum_{n >= 1} 1/(a(n) - 3/a(n)) = 1/4.
Sum_{n >= 1} (-1)^(n+1)/(a(n) + 2/a(n)) = 1/6.
Sum_{n >= 1} 1/(a(n)^2 - 3) = 1/4 - 1/sqrt(24). (End)
a(n) = 3^n*Sum_{k=0..n} (2/3)^k*binomial(2*n, 2*k). - Detlef Meya, May 21 2024

Chebyshev comments from Wolfdieter Lang, Nov 08 2002

A077221 a(0) = 0 and then alternately even and odd numbers in increasing order such that the sum of any two successive terms is a square.

Original entry on oeis.org

0, 1, 8, 17, 32, 49, 72, 97, 128, 161, 200, 241, 288, 337, 392, 449, 512, 577, 648, 721, 800, 881, 968, 1057, 1152, 1249, 1352, 1457, 1568, 1681, 1800, 1921, 2048, 2177, 2312, 2449, 2592, 2737, 2888, 3041, 3200, 3361, 3528, 3697, 3872, 4049, 4232

Offset: 0

Amarnath Murthy, Nov 03 2002

This sequence arises from reading the line from 0, in the direction 0, 1, ... and the same line from 0, in the direction 0, 8, ..., in the square spiral whose vertices are the triangular numbers A000217. Cf. A139591, etc. - Omar E. Pol, May 03 2008
The general formula for alternating sums of powers of odd integers is in terms of the Swiss-Knife polynomials P(n,x) A153641 (P(n,0)-(-1)^k*P(n,2*k))/2. Here n=2, thus a(k) = |(P(2,0)-(-1)^k*P(2,2*k))/2|. - Peter Luschny, Jul 12 2009
Axis perpendicular to A046092 in the square spiral whose vertices are the triangular numbers A000217. See the comment above. - Omar E. Pol, Sep 14 2011
Column 8 of A195040. - Omar E. Pol, Sep 28 2011
Concentric octagonal numbers. A139098 and A069129 interleaved. - Omar E. Pol, Sep 17 2011
Subsequence of A194274. - Bruno Berselli, Sep 22 2011
Partial sums of A047522. - Reinhard Zumkeller, Jan 07 2012
Alternating sum of the first n odd squares in decreasing order, n >= 1. Also number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton. The rules are: on the infinite square grid, start with all cells OFF, so a(0) = 0. Turn a single cell to the ON state, so a(1) = 1. At each subsequent step, the neighbor cells of each cell of the old generation are turned ON, and the cells of the old generation are turned OFF. Here "neighbor" refers to the eight adjacent cells of each ON cell. See example. - Omar E. Pol, Feb 16 2014

			From _Omar E. Pol_, Feb 16 2014: (Start)
Illustration of initial terms as a cellular automaton:
.
.                                   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           17              32
.
(End)

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Bruno Berselli, An origin of A077221 (illustration) (see Pol's comment).
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS.
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).
Index entries for sequences related to cellular automata.

Cf. A032528, A069129, A077222, A131925, A139098, A194274, A195040, A195041, A195042, A195142.

a077221 n = a077221_list !! n
a077221_list = scanl (+) 0 a047522_list
-- Reinhard Zumkeller, Jan 07 2012

[2*n^2 - (n mod 2): n in [0..50]]; // Vincenzo Librandi, Sep 22 2011

a := n -> 2*n^2 - (n mod 2); # Peter Luschny, Jul 12 2009

a=1;lst={a};Do[b=n^2-a;AppendTo[lst,b];a=b,{n,3,6!,2}];lst (* Vladimir Joseph Stephan Orlovsky, May 18 2009 *)

a(2n) = 8*n^2, a(2n+1) = 8*n(n+1) + 1.
From Ralf Stephan, Mar 31 2003: (Start)
a(n) = 2*n^2 + 4*n + 1 [+1 if n is odd] with a(0)=1.
G.f.: x*(x^2+6*x+1)/(1-x)^3/(1+x). (End)
Row sums of triangle A131925; binomial transform of (1, 7, 2, 4, -8, 16, -32, ...). - Gary W. Adamson, Jul 29 2007
a(n) = a(-n); a(n+1) = A195605(n) - (-1)^n. - Bruno Berselli, Sep 22 2011
a(n) = 2*n^2 + ((-1)^n-1)/2. - Omar E. Pol, Sep 28 2011
Sum_{n>=1} 1/a(n) = Pi^2/48 + tan(Pi/(2*sqrt(2)))*Pi /(4*sqrt(2)). - Amiram Eldar, Jan 16 2023

Extended by Ralf Stephan, Mar 31 2003

A049598 12 times triangular numbers.

Original entry on oeis.org

0, 12, 36, 72, 120, 180, 252, 336, 432, 540, 660, 792, 936, 1092, 1260, 1440, 1632, 1836, 2052, 2280, 2520, 2772, 3036, 3312, 3600, 3900, 4212, 4536, 4872, 5220, 5580, 5952, 6336, 6732, 7140, 7560, 7992, 8436, 8892, 9360, 9840, 10332, 10836, 11352

Offset: 0

Joe Keane (jgk(AT)jgk.org)

a(n-1) is the Wiener index of the helm graph H(n) (n>=3). The graph H(n) is obtained from an n-wheel graph (on n+1 nodes) by adjoining a pendant edge at each node of the cycle. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph. The Wiener polynomial of H(n) is (1/2)*n*t*((n-3)t^3 + 2(n-2)t^2 + (n+3)t + 6). - Emeric Deutsch, Sep 28 2010
Also sequence found by reading the line from 0, in the direction 0, 12, ..., and the same line from 0, in the direction 0, 36, ..., in the square spiral whose vertices are the generalized tetradecagonal numbers A195818. Axis perpendicular to A195158 in the same spiral. - Omar E. Pol, Sep 29 2011
Also the Wiener index of the (n+1)-gear graph. - Eric W. Weisstein, Sep 08 2017

			a(1) = 12*1 + 0 = 12;
a(2) = 12*2 + 12 = 36;
a(3) = 12*3 + 36 = 72.

G. C. Greubel, Table of n, a(n) for n = 0..5000
B. E. Sagan, Y-N. Yeh and P. Zhang, The Wiener Polynomial of a Graph, Internat. J. of Quantum Chem., Vol. 60 (1996), pp. 959-969.
Leo Tavares, Illustration: Centroid Stars.
Eric Weisstein's World of Mathematics, Gear Graph.
Eric Weisstein's World of Mathematics, Helm Graph.
Eric Weisstein's World of Mathematics, Wiener Index.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A001844, A003154, A027468, A035008, A073577.

12 * Accumulate[Range[0, 50]] (* Harvey P. Dale, Feb 05 2013 *)
(* Start from Eric W. Weisstein, Sep 08 2017 *)
Table[6 n (n + 1), {n, 0, 20}]
12 PolygonalNumber[3, Range[0, 20]]
12 Binomial[Range[20], 2]
LinearRecurrence[{3, -3, 1}, {12, 36, 72}, {0, 20}]
(* End *)

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

a(n) = 6*n*(n+1).
G.f.: 12*x/(1-x)^3.
a(n) = 12*A000217(n). - Omar E. Pol, Dec 11 2008
a(n) = 12*n + a(n-1) (with a(0)=0). - Vincenzo Librandi, Aug 06 2010
a(n) = A003154(n+1) - 1. - Omar E. Pol, Oct 03 2011
a(n) = A032528(2*n+1) - 1. - Adriano Caroli, Jul 19 2013
a(n) = A001844(n) + A073577(n). - Bruce J. Nicholson, Aug 06 2017
E.g.f.: 6*x*(x+2)*exp(x). - G. C. Greubel, Aug 23 2017
From Amiram Eldar, Feb 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/6.
Sum_{n>=1} (-1)^(n+1)/a(n) = log(2)/3 - 1/6. (End)
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(6/Pi)*cos(sqrt(5/3)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (6/Pi)*cos(Pi/(2*sqrt(3))). (End)

A032527 Concentric pentagonal numbers: floor( 5*n^2 / 4 ).

Original entry on oeis.org

0, 1, 5, 11, 20, 31, 45, 61, 80, 101, 125, 151, 180, 211, 245, 281, 320, 361, 405, 451, 500, 551, 605, 661, 720, 781, 845, 911, 980, 1051, 1125, 1201, 1280, 1361, 1445, 1531, 1620, 1711, 1805, 1901, 2000, 2101, 2205, 2311, 2420, 2531, 2645, 2761, 2880, 3001

Offset: 0

N. J. A. Sloane

Also A033429 and A062786 interleaved. - Omar E. Pol, Sep 28 2011
Partial sums of A047209. - Reinhard Zumkeller, Jan 07 2012
From Wolfdieter Lang, Aug 06 2013: (Start)
a(n) = -N(-floor(n/2),n) with the N(a,b) = ((2*a+b)^2 - b^2*5)/4, the norm for integers a + b*omega(5), a, b rational integers, in the quadratic number field Q(sqrt(5)), where omega(5) = (1 + sqrt(5))/2 (golden section).
a(n) = max({|N(a,n)|,a = -n..+n}) = |N(-floor(n/2),n)| = n^2 + n*floor(n/2) - floor(n/2)^2 = floor(5*n^2/4) (the last eq. checks for even and odd n). (End)

			From _Omar E. Pol_, Sep 28 2011 (Start):
Illustration of initial terms (In a precise representation the pentagons should appear strictly concentric):
.
.                                             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    5        11          20                31
.
(End)

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

Cf. A000290, A032528, A077043, A195041. Column 5 of A195040. [Omar E. Pol, Sep 28 2011]

a032527 n = a032527_list !! n
a032527_list = scanl (+) 0 a047209_list
-- Reinhard Zumkeller, Jan 07 2012

[5*n^2/4+((-1)^n-1)/8: n in [0..50]]; // Vincenzo Librandi, Sep 29 2011

A032527:=n->5*n^2/4+((-1)^n-1)/8: seq(A032527(n), n=0..100); # Wesley Ivan Hurt, Mar 12 2015

Table[Round[5n^2/4], {n, 0, 39}] (* Alonso del Arte, Sep 28 2011 *)

a(n)=5*n^2>>2 \\ Charles R Greathouse IV, Sep 28 2011

def A032527(n): return 5*n**2>>2  # Chai Wah Wu, Jul 30 2022

a(n) = 5*n^2/4+((-1)^n-1)/8. - Omar E. Pol, Sep 28 2011
G.f.: x*(1+3*x+x^2)/(1-2*x+2*x^3-x^4). - Colin Barker, Jan 06 2012
a(n) = a(-n); a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) for n>0, a(-1) = 1, a(0) = 0, a(1) = 1, a(2) = 5, n >= 3. (See the Bruno Berselli recurrence and a general comment for primes 1 (mod 4) under A227541). - Wolfdieter Lang, Aug 08 2013
a(n) = Sum_{j=1..n} Sum{i=1..n} ceiling((i+j-n+1)/2). - Wesley Ivan Hurt, Mar 12 2015
Sum_{n>=1} 1/a(n) = Pi^2/30 + tan(Pi/(2*sqrt(5)))*Pi/sqrt(5). - Amiram Eldar, Jan 16 2023

New name from Omar E. Pol, Sep 28 2011

cp's OEIS Frontend

A007310 Numbers congruent to 1 or 5 mod 6.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Sage

Formula

A045943 Triangular matchstick numbers: a(n) = 3*n*(n+1)/2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Scala

Formula

A007590 a(n) = floor(n^2/2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Haskell

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A003154 Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

J

Magma

Maple

Mathematica

PARI

Python

Formula

A045943 Triangular matchstick numbers: a(n) = 3n(n+1)/2.

A003154 Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6k(k-1) + 1.