cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A212959 Number of (w,x,y) such that w,x,y are all in {0,...,n} and |w-x| = |x-y|.

Original entry on oeis.org

1, 4, 11, 20, 33, 48, 67, 88, 113, 140, 171, 204, 241, 280, 323, 368, 417, 468, 523, 580, 641, 704, 771, 840, 913, 988, 1067, 1148, 1233, 1320, 1411, 1504, 1601, 1700, 1803, 1908, 2017, 2128, 2243, 2360, 2481, 2604, 2731, 2860, 2993, 3128, 3267
Offset: 0

Views

Author

Clark Kimberling, Jun 01 2012

Keywords

Comments

In the following guide to related sequences: M=max(x,y,z), m=min(x,y,z), and R=range=M-m. In some cases, it is an offset of the listed sequence which fits the conditions shown for w,x,y. Each sequence satisfies a linear recurrence relation, some of which are identified in the list by the following code (signature):
A: 2, 0, -2, 1, i.e., a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4);
B: 3, -2, -2, 3, -1;
C: 4, -6, 4, -1;
D: 1, 2, -2, -1, 1;
E: 2, 1, -4, 1, 2, -1;
F: 2, -1, 1, -2, 1;
G: 2, -1, 0, 1, -2, 1;
H: 2, -1, 2, -4, 2, -1, 2, -1;
I: 3, -3, 2, -3, 3, -1;
J: 4, -7, 8, -7, 4, -1.
...
A212959 ... |w-x|=|x-y| ...... recurrence type A
A212960 ... |w-x| != |x-y| ................... B
A212683 ... |w-x| < |x-y| .................... B
A212684 ... |w-x| >= |x-y| ................... B
A212963 ... see entry for definition ......... B
A212964 ... |w-x| < |x-y| < |y-w| ............ B
A006331 ... |w-x| < y ........................ C
A005900 ... |w-x| <= y ....................... C
A212965 ... w = R ............................ D
A212966 ... 2*w = R
A212967 ... w < R ............................ E
A212968 ... w >= R ........................... E
A077043 ... w = x > R ........................ A
A212969 ... w != x and x > R ................. E
A212970 ... w != x and x < R ................. E
A055998 ... w = x + y - 1
A011934 ... w < floor((x+y)/2) ............... B
A182260 ... w > floor((x+y)/2) ............... B
A055232 ... w <= floor((x+y)/2) .............. B
A011934 ... w >= floor((x+y)/2) .............. B
A212971 ... w < floor((x+y)/3) ............... B
A212972 ... w >= floor((x+y)/3) .............. B
A212973 ... w <= floor((x+y)/3) .............. B
A212974 ... w > floor((x+y)/3) ............... B
A212975 ... R is even ........................ E
A212976 ... R is odd ......................... E
A212978 ... R = 2*n - w - x
A212979 ... R = average{w,x,y}
A212980 ... w < x + y and x < y .............. B
A212981 ... w <= x+y and x < y ............... B
A212982 ... w < x + y and x <= y ............. B
A212983 ... w <= x + y and x <= y ............ B
A002623 ... w >= x + y and x <= y ............ B
A087811 ... w = 2*x + y ...................... A
A008805 ... w = 2*x + 2*y .................... D
A000982 ... 2*w = x + y ...................... F
A001318 ... 2*w = 2*x + y .................... F
A001840 ... w = 3*x + y
A212984 ... 3*w = x + y
A212985 ... 3*w = 3*x + y
A001399 ... w = 2*x + 3*y
A212986 ... 2*w = 3*x + y
A008810 ... 3*x = 2*x + y .................... F
A212987 ... 3*w = 2*x + 2*y
A001972 ... w = 4*x + y ...................... G
A212988 ... 4*w = x + y ...................... G
A212989 ... 4*w = 4*x + y
A008812 ... 5*w = 2*x + 3*y
A016061 ... n < w + x + y <= 2*n ............. C
A000292 ... w + x + y <=n .................... C
A000292 ... 2*n < w + x + y <= 3*n ........... C
A212977 ... n/2 < w + x + y <= n
A143785 ... w < R < x ........................ E
A005996 ... w < R <= x ....................... E
A128624 ... w <= R <= x ...................... E
A213041 ... R = 2*|w - x| .................... A
A213045 ... R < 2*|w - x| .................... B
A087035 ... R >= 2*|w - x| ................... B
A213388 ... R <= 2*|w - x| ................... B
A171218 ... M < 2*m .......................... B
A213389 ... R < 2|w - x| ..................... E
A213390 ... M >= 2*m ......................... E
A213391 ... 2*M < 3*m ........................ H
A213392 ... 2*M >= 3*m ....................... H
A213393 ... 2*M > 3*m ........................ H
A213391 ... 2*M <= 3*m ....................... H
A047838 ... w = |x + y - w| .................. A
A213396 ... 2*w < |x + y - w| ................ I
A213397 ... 2*w >= |x + y - w| ............... I
A213400 ... w < R < 2*w
A069894 ... min(|w-x|,|x-y|) = 1
A000384 ... max(|w-x|,|x-y|) = |w-y|
A213395 ... max(|w-x|,|x-y|) = w
A213398 ... min(|w-x|,|x-y|) = x ............. A
A213399 ... max(|w-x|,|x-y|) = x ............. D
A213479 ... max(|w-x|,|x-y|) = w+x+y ......... D
A213480 ... max(|w-x|,|x-y|) != w+x+y ........ E
A006918 ... |w-x| + |x-y| > w+x+y ............ E
A213481 ... |w-x| + |x-y| <= w+x+y ........... E
A213482 ... |w-x| + |x-y| < w+x+y ............ E
A213483 ... |w-x| + |x-y| >= w+x+y ........... E
A213484 ... |w-x|+|x-y|+|y-w| = w+x+y
A213485 ... |w-x|+|x-y|+|y-w| != w+x+y ....... J
A213486 ... |w-x|+|x-y|+|y-w| > w+x+y ........ J
A213487 ... |w-x|+|x-y|+|y-w| >= w+x+y ....... J
A213488 ... |w-x|+|x-y|+|y-w| < w+x+y ........ J
A213489 ... |w-x|+|x-y|+|y-w| <= w+x+y ....... J
A213490 ... w,x,y,|w-x|,|x-y| distinct
A213491 ... w,x,y,|w-x|,|x-y| not distinct
A213493 ... w,x,y,|w-x|,|x-y|,|w-y| distinct
A213495 ... w = min(|w-x|,|x-y|,|w-y|)
A213492 ... w != min(|w-x|,|x-y|,|w-y|)
A213496 ... x != max(|w-x|,|x-y|)
A213498 ... w != max(|w-x|,|x-y|,|w-y|)
A213497 ... w = min(|w-x|,|x-y|)
A213499 ... w != min(|w-x|,|x-y|)
A213501 ... w != max(|w-x|,|x-y|)
A213502 ... x != min(|w-x|,|x-y|)
...
A211795 includes a guide for sequences that count 4-tuples (w,x,y,z) having all terms in {0,...,n} and satisfying selected properties. Some of the sequences indexed at A211795 satisfy recurrences that are represented in the above list.
Partial sums of the numbers congruent to {1,3} mod 6 (see A047241). - Philippe Deléham, Mar 16 2014

Examples

			a(1)=4 counts these (x,y,z): (0,0,0), (1,1,1), (0,1,0), (1,0,1).
Numbers congruent to {1, 3} mod 6: 1, 3, 7, 9, 13, 15, 19, ...
a(0) = 1;
a(1) = 1 + 3 = 4;
a(2) = 1 + 3 + 7 = 11;
a(3) = 1 + 3 + 7 + 9 = 20;
a(4) = 1 + 3 + 7 + 9 + 13 = 33;
a(5) = 1 + 3 + 7 + 9 + 13 + 15 = 48; etc. - _Philippe Deléham_, Mar 16 2014

References

  • A. Barvinok, Lattice Points and Lattice Polytopes, Chapter 7 in Handbook of Discrete and Computational Geometry, CRC Press, 1997, 133-152.
  • P. Gritzmann and J. M. Wills, Lattice Points, Chapter 3.2 in Handbook of Convex Geometry, vol. B, North-Holland, 1993, 765-797.

Links

Crossrefs

Cf. A047241, A211795.

Programs

  • Mathematica
    t = Compile[{{n, _Integer}}, Module[{s = 0},
(Do[If[Abs[w - x] == Abs[x - y], s = s + 1],
{w, 0, n}, {x, 0, n}, {y, 0, n}]; s)]];
m = Map[t[#] &, Range[0, 50]]   (* A212959 *)
  • PARI
    a(n)=(6*n^2+8*n+3)\/4 \\ Charles R Greathouse IV, Jul 28 2015

Formula

a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4).
G.f.: (1+2*x+3*x^2)/((1+x)*(1-x)^3).
a(n) + A212960(n) = (n+1)^3.
a(n) = (6*n^2 + 8*n + 3 + (-1)^n)/4. - Luce ETIENNE, Apr 05 2014
a(n) = 2*A069905(3*(n+1)+2) - 3*(n+1). - Ayoub Saber Rguez, Aug 31 2021

A213390 Number of (w,x,y) with all terms in {0,...,n} and max(w,x,y) >= 2*min(w,x,y).

Original entry on oeis.org

1, 7, 25, 55, 109, 181, 289, 421, 601, 811, 1081, 1387, 1765, 2185, 2689, 3241, 3889, 4591, 5401, 6271, 7261, 8317, 9505, 10765, 12169, 13651, 15289, 17011, 18901, 20881, 23041, 25297, 27745, 30295, 33049, 35911, 38989, 42181, 45601
Offset: 0

Views

Author

Clark Kimberling, Jun 11 2012

Keywords

Comments

a(n)+A213389(n) = (n+1)^3.
For a guide to related sequences, see A212959.

Links

Crossrefs

Cf. A212959.

Programs

  • Mathematica
    t = Compile[{{n, _Integer}}, Module[{s = 0},
(Do[If[Max[w, x, y] >= 2*Min[w, x, y], s = s + 1],
{w, 0, n}, {x, 0, n}, {y, 0, n}]; s)]];
m = Map[t[#] &, Range[0, 50]]   (* A213390 *)

Formula

a(n) = 2*a(n-1)+a(n-2)-4*a(n-3)+a(n-4)+2*a(n-5)-a(n-6).
G.f.: (1 + 5*x + 10*x^2 + 2*x^3 + x^4 - x^5)/((1 - x)^4*(1 + x)^2).
a(n) = (6*n^3+24*n^2+21*n+8+3*n*(-1)^n)/8. - Luce ETIENNE, Jul 17 2016

A275112 Zero together with the partial sums of A064412.

Original entry on oeis.org

0, 1, 6, 20, 52, 112, 215, 375, 613, 948, 1407, 2013, 2799, 3793, 5034, 6554, 8398, 10603, 13220, 16290, 19870, 24006, 28761, 34185, 40347, 47302, 55125, 63875, 73633, 84463, 96452, 109668, 124204, 140133, 157554, 176544, 197208, 219628, 243915, 270155, 298465, 328936, 361691, 396825, 434467, 474717, 517710, 563550, 612378, 664303, 719472
Offset: 0

Views

Author

Luce ETIENNE, Jul 17 2016

Keywords

Links

Crossrefs

Cf. A064412, A213389, A006003.

Programs

  • Mathematica
    {0}~Join~Accumulate@ CoefficientList[Series[(1 + x + x^2) (1 + 2 x + x^2 + 3 x^3)/((1 - x)^2 (1 - x^2) (1 - x^4)), {x, 0, 49}], x] (* Michael De Vlieger, Jul 18 2016, after Wesley Ivan Hurt at A064412, or *)
Table[(14 n^4 + 36 n^3 + 36 n^2 + 42 n + 11 + 3 (2 n - 1) (-1)^n - 8 (-1)^(((2 n - 1 + (-1)^n))/4))/128, {n, 50}] (* Michael De Vlieger, Jul 18 2016 *)
LinearRecurrence[{3,-2,-2,4,-4,2,2,-3,1},{0,1,6,20,52,112,215,375,613},60] (* Harvey P. Dale, Jun 19 2022 *)
  • PARI
    concat(0, Vec(x*(1+x+x^2)*(1+2*x+x^2+3*x^3)/((1-x)^5*(1+x)^2*(1+x^2)) + O(x^50))) \\ Colin Barker, Jul 18 2016

Formula

a(n) = (28*n^4+36*n^3+18*n^2+12*n+(1-(-1)^n))/16 for n even.
a(n) = (28*n^4+92*n^3+114*n^2+68*n+17-(-1)^n)/16 for n odd.
a(n) = (14*n^4+36*n^3+36*n^2+42*n+11+3*(2*n-1)*(-1)^n-8*(-1)^(((2*n-1+(-1)^n))/4))/128.
G.f.: x*(1+x+x^2)*(1+2*x+x^2+3*x^3) / ((1-x)^5*(1+x)^2*(1+x^2)). - Colin Barker, Jul 18 2016

A280304 a(n) = 3*n*(n^2 + 3*n + 4).

Original entry on oeis.org

0, 24, 84, 198, 384, 660, 1044, 1554, 2208, 3024, 4020, 5214, 6624, 8268, 10164, 12330, 14784, 17544, 20628, 24054, 27840, 32004, 36564, 41538, 46944, 52800, 59124, 65934, 73248, 81084, 89460, 98394, 107904, 118008, 128724, 140070, 152064, 164724, 178068, 192114, 206880, 222384, 238644, 255678, 273504, 292140, 311604, 331914, 353088, 375144, 398100
Offset: 0

Views

Author

Luce ETIENNE, Dec 31 2016

Keywords

Comments

Numbers of unit triangles in a certain structure obtained from A006003.

Examples

			a(0) = 6*(1-1) = 0, a(1) = 6*(5-1) = 24, a(2) = 6*(15-1) = 84, a(3) = 6*(34-1) = 198, a(4) = 6*(65-1) = 384.

Links

Crossrefs

Cf. A003215, A005448, A006003, A033428, A213389, A269064.

Programs

  • Magma
    [3*n*(n^2 + 3*n + 4) : n in [0..60]]; // Wesley Ivan Hurt, Dec 31 2016
  • Maple
    A280304:=n->3*n*(n^2 + 3*n + 4): seq(A280304(n), n=0..60); # Wesley Ivan Hurt, Dec 31 2016
  • Mathematica
    Table[3 n (n^2 + 3 n + 4), {n, 0, 50}] (* or *)
CoefficientList[Series[6 x (x^2 - 2 x + 4)/(1 - x)^4, {x, 0, 50}], x] (* Michael De Vlieger, Dec 31 2016 *)
LinearRecurrence[{4,-6,4,-1},{0,24,84,198},60] (* Harvey P. Dale, Feb 08 2023 *)
  • PARI
    concat(0, Vec(6*x*(x^2-2*x+4) / (1-x)^4 + O(x^30))) \\ Colin Barker, Dec 31 2016

Formula

G.f.: 6*x*(x^2-2*x+4) / (1-x)^4.
a(n) = 6*(A006003(n+1)-1).
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n > 3. - Colin Barker, Dec 31 2016
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.