A084684 -id:A084684 - cp's OEIS frontend

A077043 "Three-quarter squares": a(n) = n^2 - A002620(n).

0, 1, 3, 7, 12, 19, 27, 37, 48, 61, 75, 91, 108, 127, 147, 169, 192, 217, 243, 271, 300, 331, 363, 397, 432, 469, 507, 547, 588, 631, 675, 721, 768, 817, 867, 919, 972, 1027, 1083, 1141, 1200, 1261, 1323, 1387, 1452, 1519, 1587, 1657, 1728, 1801, 1875, 1951

Offset: 0

Henry Bottomley, Oct 22 2002

Triangular numbers plus quarter squares: (n+1)*(n+2)/2 + floor(n^2/4) (i.e., A000217(n+1) + A002620(n)).
Largest coefficient in the expansion of (1+x+x^2+...+x^(n-1))^3=((1-x^n)/(1-x))^3, i.e., the coefficient of x^floor[3(n-1)/2] and of x^ceiling[3(n-1)/2]; also number of compositions of [3(n+1)/2] into exactly 3 positive integers each no more than n.
A set of n independent statements a,b,c,d..., produces n^2 conditional statements of the form "If a, then b" (including self-implications such as "If a, then a"). If such statements are taken as equivalent to "It is not the case that the first statement is true and the second is false" (material implication), A077043(n) is the minimum number of the conditional statements that can be true. (The maximum number of false conditional statements is A002620(n), the maximum product of two integers whose sum is n.) - Matthew Vandermast, Mar 04 2003
This is also the maximum number of triple intersections between three sets of n lines, where the lines in each set are parallel to each other. E.g., for n=3:
\.\.\.../././
.\.\.\./././.
..\.\.x././..
---+-*-*-+---
----*-*-*----
---+-*-*-+---
.././.x.\.\..
./././.\.\.\.
/././...\.\.\
where '*' = triple intersection, '+' and 'x' = double intersection.
I am pretty sure that the hexagonal configuration of intersections shown above is the optimum and I get the formulas a(n) = (3n^2)/4 for n even and (3n^2+1)/4 for n odd. - Gabriel Nivasch (gnivasch(AT)yahoo.com), Jan 13 2004
For n > 1 the sequence represents the maximum number of points that can be placed in a plane such that the largest distances between any two points does not exceed the shortest of the distances between any two points by more than a factor n-1. - Johannes Koelman (Joc_kay(AT)hotmail.com), Apr 27 2006
This is also the number of distinct noncongruent isosceles triangles with side length up to n. - Patrick Hurst (patrick(AT)imsa.edu), May 14 2008
Also concentric triangular numbers. A033428 and A003215 interleaved. - Omar E. Pol, Sep 28 2011
Number of (w,x,y) with all terms in {0,...,n} and w=x>range{w,x,y}. - Clark Kimberling, Jun 02 2012
Number of pairs (x,y) with x in {0,...,n}, y even in {0,...,2n}, and x<=y. - Clark Kimberling, Jul 02 2012
From Bob Selcoe, Aug 05 2013: (Start)
a(n) is the number of 3-member sets with non-repeating positive integer values (x,y,z) whose sums equal 3(n+1). Example: a(4)=12; thus there are 12 sets where x+y+z = 15: (1,2,12), (1,3,11), (1,4,10), (1,5,9), (1,6,8), (2,3,10), (2,4,9), (2,5,8), (2,6,7), (3,4,8), (3,5,7) and (4,5,6).
From above, the number of sets sharing minimum values (minvals) equals a(1)-a(0), a(2)-a(1), a(3)-a(2),... a(n)-a(n-1) which are the numbers not divisible by 3, in sequence (A001651), range n to 1. So in the above example, there is one set with minval 4, two sets with minval 3, four sets with minval 2 and five sets with minval 1. (End)
Number of partitions of 3n into exactly 3 parts. - Wesley Ivan Hurt, Jan 21 2014
Number of partitions of 3(n-1) into at most 3 parts. - Colin Barker, Mar 31 2015
Number of possible positions after n-1 steps on the lines of a hexagonal grid. - Reg Robson, Mar 08 2014
12*a(n) is a perfect square when n is even and 12*a(n) - 3 is a perfect square when n is odd. - Miquel Cerda, Jun 30 2016
Square of largest Euclidean distance from start point reachable by an n-step walk on a honeycomb lattice. - Hugo Pfoertner, Jun 21 2018

			G.f. = x + 3*x^2 + 7*x^3 + 12*x^4 + 19*x^5 + 27*x^6 + 37*x^7 + 48*x^8 + ...
a(4)=12 since the compositions of floor(3*(4+1)/2) = 7 into exactly 3 positive integers each no more than 4 are 1+2+4, 1+3+3, 1+4+2, 2+1+4, 2+2+3, 2+3+3, 2+4+1, 3+1+3, 3+2+2, 3+3+1, 4+1+2, 4+2+1.
From _Philippe Deléham_, Dec 17 2011: (Start)
a(1) = 1 = 1^3;
a(1) + a(3) = 1 + 7 = 2^3;
a(1) + a(3) + a(5) = 1 + 7 + 19 = 3^3;
a(1) + a(3) + a(5) + a(7) = 1 + 7 + 19 + 37 = 4^3;
a(1) + a(3) + a(5) + a(7) + a(9) = 1 + 7 + 19 + 37 + 61 = 5^3; ... (End)

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 64.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Ralf Hinze, Concrete stream calculus: An extended study, J. Funct. Progr. 20 (5-6) (2010) 463-535, doi, Section 4.4.4.
Clark Kimberling and John E. Brown, Partial Complements and Transposable Dispersions, J. Integer Seqs., Vol. 7 (2004), Article 04.1.6.
Gabriel Nivasch and Eyal Lev, Nonattacking Queens on a Triangle, Mathematics Magazine, Vol. 78, No. 5 (Dec., 2005), pp. 399-403. See page 402.
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).
Index entries for sequences related to compositions.

Column 3 of A195040. - Omar E. Pol, Sep 28 2011
Cf. A019298 (partial sums).
Cf. A002620, A033428, A003215.
Equals one more than A331952 and one less than A084684. - Greg Dresden, Feb 22 2020

a077043 n = a077043_list !! n
a077043_list = scanl (+) 0 a001651_list
-- Reinhard Zumkeller, Jan 06 2014

[Ceiling(n^2*3/4): n in [0..60]]; // Vincenzo Librandi, Jun 29 2011

A077043:=n->ceil(3*n^2/4); seq(A077043(n), n=0..60); # Wesley Ivan Hurt, Jan 21 2014

Table[Ceiling[(3n^2)/4], {n,0,60}] (* or *) LinearRecurrence[{2,0,-2,1}, {0,1,3,7}, 60] (* Harvey P. Dale, Dec 16 2012 *)

{a(n) = n^2 - (n^2 \ 4)}; /* Michael Somos, Jun 29 2011 */

a(n) = ceiling(n^2*3/4) = A077042(n, 3); a(-n) = a(n).
Also can be computed from 1 * C(n,0) + 2 * C(n,1) + 2 * C(n,2) - Sum((-2)^(k-3) C(n, k)). - Joshua Zucker, Nov 10 2002
a(n) = A002620(n-1) + A002620(n) + A002620(n+1). - Jon Perry, May 29 2003
From Jon Perry, May 29 2003: (Start)
a(2k)   = a(2k-2) + 6k - 3,
a(2k+1) = a(2k-1) + 6k,
a(4n)   = 12n^2,
a(4n+1) = a(4n)   + 6n + 1,
a(4n+2) = a(4n+1) + 6n + 2,
a(4n+3) = a(4n+2) + 6n + 4,
a(4n+4) = a(4n+3) + 6n + 5.
Differences between alternate terms give 3, 6, 9, 12, ... (End)
a(n+1) - a(n) = A001651(n), partial sums of A001651. - Reinhard Zumkeller, Dec 28 2007
From R. J. Mathar, Nov 10 2008: (Start)
G.f.: x*(1+x+x^2)/((1+x)*(1-x)^3).
a(n) + a(n+1) = A005448(n+1).
The inverse binomial transform yields 0 followed by A141531. (End)
Euler transform of length 3 sequence [3, 1, -1]. - Michael Somos, Jun 29 2011
a(n) = 3*n^2/4 - ((-1)^n-1)/8. - Omar E. Pol, Sep 28 2011
Sum_{k=0..n} a(2k+1) = partial sums of A003215 = (n+1)^3 (see example). - Philippe Deléham, Dec 17 2011
a(0)=0, a(1)=1, a(2)=3, a(3)=7, a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4). - Harvey P. Dale, Dec 16 2012
a(0)=0, a(1)=1, a(n) = 3*(n-1) + a(n-2). - Reg Robson, Mar 08 2014
a(2k) = 3k^2 = A033428(k), a(2k+1) = 3k^2 + 3k + 1 = A003215(k). - Jon Perry, Oct 25 2014
a(n) = Sum_{j=1..n} Sum_{i=1..n} ceiling((i+j-n)/2). - Wesley Ivan Hurt, Mar 12 2015
a(n) = (3*n)^2/12 for n even and a(n) = ((3*n)^2 + 3)/12 for n odd. - Miquel Cerda, Jun 30 2016
a(n) = Sum_{k=1..n} floor((n+k)/2). - Wesley Ivan Hurt, Mar 31 2017
0 = 1 +a(n)*(+a(n+1) -a(n+2)) +a(n+1)*(-3 -a(n+1) +a(n+2)) for all n in Z. - Michael Somos, Apr 02 2017
E.g.f.: (1/8)*exp(-x)*(-1 + exp(2*x)*(1 + 6*x + 6*x^2)). - Stefano Spezia, Nov 29 2019
Sum_{n>=1} 1/a(n) = Pi^2/18 + tanh(Pi/(2*sqrt(3)))*Pi/sqrt(3). - Amiram Eldar, Jan 16 2023

A331952 a(n) = (-7 + (-1)^(1+n) + 6*n^2) / 8.

Original entry on oeis.org

-1, 0, 2, 6, 11, 18, 26, 36, 47, 60, 74, 90, 107, 126, 146, 168, 191, 216, 242, 270, 299, 330, 362, 396, 431, 468, 506, 546, 587, 630, 674, 720, 767, 816, 866, 918, 971, 1026, 1082, 1140, 1199, 1260, 1322, 1386, 1451, 1518, 1586, 1656, 1727, 1800, 1874, 1950, 2027

Offset: 0

Paul Curtz, Feb 02 2020

a(n+1) is once in the hexagonal spiral in A330707. a(n+2) is twice in the same spiral.
a(n) has one odd followed by three evens.
Difference table:
  -1, 0, 2, 6, 11, 18, 26, 36, ... = a(n)
   1, 2, 4, 5,  7,  8, 10, 11, ... = A001651(n+1)
   1, 2, 1, 2,  1,  2,  1,  2, ... = A000034.

			G.f. = -1 + 2*x^2 + 6*x^3 + 11*x^4 + 18*x^5 + 26*x^6 + 36*x^7 + 47*x^8 + ... - _Michael Somos_, Sep 08 2023

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).
Index entries for two-way infinite sequences

Cf. A000034, A001651, A158463, 6*A014105, 2*A003154, A152746(n+1), A008585(1+n).

Equals 2 less than A084684, 1 less than A077043, and 1 more than A276382(n-1). - Greg Dresden, Feb 22 2020

a:=[-1,0,2,6]; [n le 4 select a[n] else 2*Self(n-1)-2*Self(n-3)+Self(n-4): n in [1..45]]; // Marius A. Burtea, Feb 02 2020

LinearRecurrence[{2, 0, -2, 1}, {-1, 0, 2, 6}, 100] (* Amiram Eldar, Feb 02 2020 *)
a[n_] := Floor[(n^2 - 1)*3/4]; (* Michael Somos, Sep 08 2023 *)

Vec(-(1 - 2*x - 2*x^2) / ((1 - x)^3*(1 + x)) + O(x^40)) \\ Colin Barker, Feb 03 2020

{a(n) = (n^2 - 1)*3\4}; /* Michael Somos, Sep 08 2023 */

a(-n) = a(n).
a(20+n) - a(n) = 30*(10+n).
a(2+n) = a(n) + 3*(1+n), a(0)=-1 and a(1)=0.
a(4*n) = 12*n^2 - 1, a(1+4*n) = 6*n*(1+2*n), a(2+4*n) = 2 + 12*n*(1+n), a(3+4*n) = 6*(1+n)*(1+2*n) for n>= 0.
From Colin Barker, Feb 02 2020: (Start)
G.f.: -(1 - 2*x - 2*x^2) / ((1 - x)^3*(1 + x)).
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) for n>3.
a(n) = (-7 + (-1)^(1+n) + 6*n^2) / 8.
(End)
E.g.f.: (1/8)*(exp(x)*(6*x^2 + 6*x - 7) - exp(-x)). - Stefano Spezia, Feb 02 2020 after Colin Barker
a(n) = floor((n^2 - 1)*3/4). - Michael Somos, Sep 09 2023

a(42)-a(52) from Stefano Spezia, Feb 02 2020

A276382 a(1) = 1, and a(n) = a(n-1) + floor(3*n/2) + 1 for n >= 2.

Original entry on oeis.org

1, 5, 10, 17, 25, 35, 46, 59, 73, 89, 106, 125, 145, 167, 190, 215, 241, 269, 298, 329, 361, 395, 430, 467, 505, 545, 586, 629, 673, 719, 766, 815, 865, 917, 970, 1025, 1081, 1139, 1198, 1259, 1321, 1385, 1450, 1517, 1585, 1655, 1726, 1799, 1873, 1949, 2026

Offset: 1

Bob Selcoe, Sep 01 2016

Given 3 distinct numbers i, j and k whose prime signatures are exactly n 1's, then a(n) is the number of prime signatures for all permutations of i*j*k.
a(n) is the number of partitions of 3n such that there are no more than n-1 3's and no parts > 3.
a(3n+1) represents the number of prime signature sets whose members are excluded as terms in A026477, as a consequence of being products of three smaller terms whose prime signatures are exactly 3n+1 1's.
First differences are floor(3n/2) + 1 (A001651(n+1)); second differences are 1 when n is even and 2 when n is odd; third differences are 1 when n is even and -1 when n is odd.

			a(2)=5; the 5 prime signatures / partitions are: {3,1,1,1}, {2,2,2}, {2,2,1,1}, {2,1,1,1} and {1,1,1,1,1,1}.
G.f. = x + 5*x^2 + 10*x^3 + 17*x^4 + 25*x^5 + 35*x^6 + 46*x^7 + ... - _Michael Somos_, Sep 08 2023

Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Cf. A000040 (prime numbers), A001651, A026477.

Equals one less than A331952(n+1), two less than A077043(n+1), and three less than A084684(n+1). - Greg Dresden, Feb 22 2020

[((-1)^n+12*n+6*n^2-9)/8: n in [1..60]]; // Vincenzo Librandi, Sep 10 2016

a[1] = 1; a[n_] := a[n] = a[n - 1] + Floor[3 n/2] + 1 ; Array[a, 51] (* Michael De Vlieger, Sep 01 2016 *)
a[n_] := Floor[(3*(n+1)^2 - 7)/4]; (* Michael Somos, Sep 08 2023 *)

Vec(x*(1+3*x-x^3)/((1-x)^3*(1+x)) + O(x^60)) \\ Colin Barker, Sep 01 2016

{a(n) = (3*(n+1)^2 - 7)\4}; /* Michael Somos, Sep 09 2023 */

From Colin Barker, Sep 01 2016: (Start)
a(n) = ((-1)^n + 12*n + 6*n^2 - 9)/8 for n > 0.
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) for n > 4.
G.f.: x*(1 + 3*x - x^3) / ((1-x)^3*(1+x)). (End)
a(n) = -1 + Sum_{k=1..n} floor((n+k+3)/2). - Wesley Ivan Hurt, Apr 01 2017
a(n) = a(-2-n) for all n in Z. - Michael Somos, Sep 08 2023
a(n) = floor((3*(n+1)^2 - 7)/4). - Michael Somos, Sep 09 2023

cp's OEIS Frontend

A164486 Duplicate of A084684.

Views

Author

Keywords

Links

A077043 "Three-quarter squares": a(n) = n^2 - A002620(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

A331952 a(n) = (-7 + (-1)^(1+n) + 6*n^2) / 8.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

Extensions

A276382 a(1) = 1, and a(n) = a(n-1) + floor(3*n/2) + 1 for n >= 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A302588 a(n) = a(n-3) + 7*(n-2), a(0)=1, a(1)=2, a(2)=4.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula