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-8 of 8 results.

A211795 Number of (w,x,y,z) with all terms in {1,...,n} and w*x < 2*y*z.

Original entry on oeis.org

0, 1, 11, 58, 177, 437, 894, 1659, 2813, 4502, 6836, 10008, 14121, 19449, 26117, 34372, 44422, 56597, 71044, 88160, 108115, 131328, 158074, 188773, 223604, 263172, 307719, 357715, 413493, 475690, 544480, 620632, 704381, 796413
Offset: 0

Views

Author

Clark Kimberling, Apr 27 2012

Keywords

Comments

Each sequence in the following guide counts 4-tuples
(w,x,y,z) such that the indicated relation holds and the four numbers w,x,y,z are in {1,...,n}. The notation "m div" means that m divides every term of the sequence.
A211058 ... wx <= yz
A211787 ... wx <= 2yz
A211795 ... wx < 2yz
A211797 ... wx > 2yz
A211809 ... wx >= 2yz
A211812 ... wx <= 3yz
A211917 ... wx < 3yz
A211918 ... wx > 3yz
A211919 ... wx >= 3yz
A211920 ... 2wx < 3yz
A211921 ... 2wx <= 3yz
A211922 ... 2wx > 3yz
A211923 ... 2wx >= 3yz
A212019 ... wx = 2yz ..... 2 div
A212020 ... wx = 3yz ..... 2 div
A212021 ... 2wx = 3yz .... 2 div
A212047 ... wx = 4yz
A212048 ... 3wx = 4yz .... 2 div
A212049 ... wx = 5yz ..... 2 div
A212050 ... 2wx = 5yz .... 2 div
A212051 ... 3wx = 5yz .... 2 div
A212052 ... 4wx = 5yz .... 2 div
A209978 ... wx = yz + 1 .. 2 div
A212053 ... wx <= yz + 1
A212054 ... wx > yz + 1
A212055 ... wx <= yz + 2
A212056 ... wx > yz + 2
A197168 ... wx = yz + 2 .. 2 div
A061201 ... w = xyz
A212057 ... w < xyz
A212058 ... w >= xyz
A212059 ... w = xyz - 1
A212060 ... w = xyz - 2
A212061 ... wx = (yz)^2
A212062 ... w^2 = xyz
A212063 ... w^2 < xyz
A212064 ... w^2 >= xyz
A212065 ... w^2 <= xyz
A212066 ... w^2 > xyz
A212067 ... w^3 = xyz
A002623 ... w = 2x + y + z
A006918 ... w = 2x + 2y + z
A000601 ... w = x + 2y + 3z (except for initial 0's)
A212068 ... 2w = x + y + z
A212069 ... 3w = x + y + z (w = average{x,y,z})
A212088 ... 3w < x + y + z
A212089 ... 3w >= x + y + z
A212090 ... w < x + y + z
A000332 ... w >= x + y + z
A212145 ... w < 2x + y + z
A001752 ... w >= 2x + y + z
A001400 ... w = 2x +3y + 4z
A005900 ... w = -x + y + z
A192023 ... w = -x + y + z + 2
A212091 ... w^2 = x^2 + y^2 + z^2 ... 3 div
A212087 ... w^2 + x^2 = y^2 + z^2
A212092 ... w^2 < x^2 + y^2 + z^2
A212093 ... w^2 <= x^2 + y^2 + z^2
A212094 ... w^2 > x^2 + y^2 + z^2
A212095 ... w^2 >= x^2 + y^2 + z^2
A212096 ... w^3 = x^3 + y^3 + z^3 ... 6 div
A212097 ... w^3 < x^3 + y^3 + z^3
A212098 ... w^3 <= x^3 + y^3 + z^3
A212099 ... w^3 > x^3 + y^3 + z^3
A212100 ... w^3 >= x^3 + y^3 + z^3
A212101 ... wx^2 = yz^2
A212102 ... 1/w = 1/x + 1/y + 1/z
A212103 ... 3/w = 1/x + 1/y + 1/z; w = h.m. of {x,y,z}
A212104 ... 3/w >= 1/x + 1/y + 1/z; w >= h.m.
A212105 ... 3/w < 1/x + 1/y + 1/z; w < h.m.
A212106 ... 3/w > 1/x + 1/y + 1/z; w > h.m.
A212107 ... 3/w <= 1/x + 1/y + 1/z; w <= h.m.
A212133 ... median(w,x,y,z) = mean(w,x,y,z)
A212134 ... median(w,x,y,z) <= mean(w,x,y,z)
A212135 ... median(w,x,y,z) > mean(w,x,y,z)
A212241 ... wx + yz > n
A212243 ... 2wx + yz = n
A212244 ... w = xyz - n
A212245 ... w = xyz - 2n
A212246 ... 2w = x + y + z - n
A212247 ... 3w = x + y + z + n
A212249 ... 3w < x + y + z + n
A212250 ... 3w >= x + y + z + n
A212251 ... 3w = x + y + z + n + 1
A212252 ... 3w = x + y + z + n + 2
A212254 ... w = x + 2y + 3z - n
A212255 ... w^2 = mean(x^2, y^2, z^2)
A212256 ... 4/w = 1/x + 1/y +1/z + 1/n
In the list above, if the relation in the second column is of the form "w rel ax + by + cz" then the sequence is linearly recurrent. In the list below, the same is true for expressions involving more than one relation.
A000332 ... w < x <= y < z .... C(n,4)
A000914 ... w < x <= y < z .... Stirling 1st kind
A000914 ... w < x <= y >= z ... Stirling 1st kind
A050534 ... w < x < y >= z .... tritriangular
A001296 ... w <= x <= y >= z .. 4-dim pyramidal
A006322 ... x < x > y >= z
A002418 ... w < x >= y < z
A050534 ... w < x >=y >= z
A212415 ... w < x >= y <= z
A001296 ... w < x >= y <= z
A212246 ... w <= x > y <= z
A006322 ... w <= x >= y <= z
A212501 ... w > x < y >= z
A212503 ... w < 2x and y < 2z ..... A (note below)
A212504 ... w < 2x and y > 2z ..... A
A212505 ... w < 2x and y >= 2z .... A
A212506 ... w <= 2x and y <= 2z ... A
A212507 ... w < 2x and y <= 2z .... B
A212508 ... w < 2x and y < 3z ..... C
A212509 ... w < 2x and y <= 3z .... C
A212510 ... w < 2x and y > 3z ..... C
A212511 ... w < 2x and y >= 3z .... C
A212512 ... w <= 2x and y < 3z .... C
A212513 ... w <= 2x and y <= 3z ... C
A212514 ... w <= 2x and y > 3z .... C
A212515 ... w <= 2x and y >= 3z ... C
A212516 ... w > 2x and y < 3z ..... C
A212517 ... w > 2x and y <= 3z .... C
A212518 ... w > 2x and y > 3z ..... C
A212519 ... w > 2x and y >= 3z .... C
A212520 ... w >= 2x and y < 3z .... C
A212521 ... w >= 2x and y <= 3z ... C
A212522 ... w >= 2x and y > 3z .... C
A212523 ... w + x < y + z
A212560 ... w + x <= y + z
A212561 ... w + x = 2y + 2z
A212562 ... w + x < 2y + 2z ....... B
A212563 ... w + x <= 2y + 2z ...... B
A212564 ... w + x > 2y + 2z ....... B
A212565 ... w + x >= 2y + 2z ...... B
A212566 ... w + x = 3y + 3z
A212567 ... 2w + 2x = 3y + 3z
A212570 ... |w - x| = |x - y| + |y - z|
A212571 ... |w - x| < |x - y| + |y - z| ... B ... 4 div
A212572 ... |w - x| <= |x - y| + |y - z| .. B
A212573 ... |w - x| > |x - y| + |y - z| ... B ... 2 div
A212574 ... |w - x| >= |x - y| + |y - z| .. B
A212575 ... 2|w - x| = |x - y| + |y - z|
A212576 ... |w - x| = 2|x - y| + 2|y - z|
A212577 ... |w - x| = 2|x - y| - |y - z|
A212578 ... 2|w - x| = |x - y| - |y - z|
A212579 ... min{|w-x|,|w-y|} = min{|x-y|,|x-z|}
A212692 ... w = |x - y| + |y - z| ............... 2 div
A212568 ... w < |x - y| + |y - z| ............... 2 div
A212573 ... w <= |x - y| + |y - z| .............. 2 div
A212574 ... w > |x - y| + |y - z|
A212575 ... w >= |x - y| + |y - z|
A212676 ... w + x = |x - y| + |y - z| ......... H
A212677 ... w + y = |x - y| + |y - z|
A212678 ... w + x + y = |x - y| + |y - z|
A006918 ... w + x + y + z = |x - y| + |y - z| . H
A212679 ... |x - y| = |y - z| ................. H
A212680 ... |x - y| = |y - z| + 1 ..............H 2 div
A212681 ... |x - y| < |y - z| ................... 2 div
A212682 ... |x - y| >= |y - z|
A212683 ... |x - y| = w + |y - z| ............... 2 div
A212684 ... |x - y| = n - w + |y - z|
A212685 ... |w - x| = w + |y - z|
A186707 ... |w - x| < w + |y - z| ... (Note D)
A212714 ... |w - x| >= w + |y - z| .......... H . 2 div
A212686 ... 2*|w - x| = n + |y - z| ............. 4 div
A212687 ... 2*|w - x| < n + |y - z| ......... B
A212688 ... 2*|w - x| < n + |y - z| ......... B . 2 div
A212689 ... 2*|w - x| > n + |y - z| ......... B . 2 div
A212690 ... 2*|w - x| <= n + |y - z| ........ B
A212691 ... w + |x - y| = |x - z| + |y - z| . E . 2 div
...
In the above lists, all the terms of (w,x,y,z) are in {1,...,n}, but in the next lists they are all in {0,...,n}, and sequences are all linearly recurrent.
R=range{w,x,y,z}=max{w,x,y,z}-min{w,x,y,z}.
A212740 ... max{w,x,y,z} < 2*min{w,x,y,z} .... A
A212741 ... max{w,x,y,z} >= 2*min{w,x,y,z} ... A
A212742 ... max{w,x,y,z} <= 2*min{w,x,y,z} ... A
A212743 ... max{w,x,y,z} > 2*min{w,x,y,z} .... A . 2 div
A212744 ... w=range (=max-min) ............... E
A212745 ... w=max{w,x,y,z} - 2*min{w,x,y,z}
A212746 ... R is in {w,x,y,z} ................ E
A212569 ... R is not in {w,x,y,z} ............ E
A212749 ... w=R or x
A212750 ... w=R or x=R or y
A212751 ... w=R or x=R or y
A212752 ... wR ......... A
A212753 ... wR or z>R ......... D
A212754 ... wR or y>R or z>R ......... D
A002415 ... w = x + R ........................ D
A212755 ... |w - x| = R ...................... D
A212756 ... 2w = x + R
A212757 ... 2w = R
A212758 ... w = floor(R/2)
A002413 ... w = floor((x+y+z/2))
A212759 ... w, x, y are even
A212760 ... w is even and x = y + z .......... E
A212761 ... w is odd and x and y are even .... F . 2 div
A212762 ... w and x are odd y is even ........ F . 2 div
A212763 ... w, x, y are odd .................. F
A212764 ... w, x, y are even and z is odd .... F
A030179 ... w and x are even and y and z odd
A212765 ... w is even and x,y,z are odd ...... F
A212766 ... w is even and x is odd ........... A . 2 div
A212767 ... w and x are even and w+x=y+z ..... E
A212889 ... R is even ........................ A
A212890 ... R is odd ......................... A . 2 div
A212742 ... w-x, x-y, y-z are all even ....... A
A212892 ... w-x, x-y, y-z are all odd ........ A
A212893 ... w-x, x-y, y-z have same parity ... A
A005915 ... min{|w-x|, |x-y|, |y-z|} = 0
A212894 ... min{|w-x|, |x-y|, |y-z|} = 1
A212895 ... min{|w-x|, |x-y|, |y-z|} = 2
A179824 ... min{|w-x|, |x-y|, |y-z|} > 0
A212896 ... min{|w-x|, |x-y|, |y-z|} <= 1
A212897 ... min{|w-x|, |x-y|, |y-z|} > 1
A212898 ... min{|w-x|, |x-y|, |y-z|} <= 2
A212899 ... min{|w-x|, |x-y|, |y-z|} > 2
A212901 ... |w-x| = |x-y| = |y-z|
A212900 ... |w-x|, |x-y|, |y-z| are distinct . G
A212902 ... |w-x| < |x-y| < |y-z| ............ G
A212903 ... |w-x| <= |x-y| <= |y-z| .......... G
A212904 ... |w-x| + |x-y| + |y-z| = n ........ H
A212905 ... |w-x| + |x-y| + |y-z| = 2n ....... H
...
Note A: A212503-A212506 (and others) have these recurrence coefficients: 2,2,-6,0,6,-2,-2,1.
B: 3,-1,-5,5,1,-3,1
C: 0,2,2,-1,-4,0,2,0,-2,0,4,1,-2,-2,0,1
D: 4,-5,0,5,-4,1
E: 1,3,-3,-3,3,1,-1
F: 1,4,-4,-6,6,4,-4,-1,1
G: 2,1,-3,-1,1,3,-1,-2,1
H: 2,1,-4,1,2,-1

Examples

			a(2)=11 counts these (w,x,y,z): (1,1,1,1), (1,1,1,2), (1,1,2,1), (2,1,2,1), (2,1,1,2), (1,2,2,1), (1,2,1,2), (1,1,2,2), (1,2,2,2), (2,1,2,2), (2,2,2,2).

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. A000583 (n^4), A210000, A211809, A212959.

Programs

  • Mathematica
    t = Compile[{{n, _Integer}}, Module[{s = 0},
    (Do[If[w*x < 2 y*z, s = s + 1], {w, 1, #},
      {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
Map[t[#] &, Range[0, 40]] (* A211795 *)
(* Peter J. C. Moses, Apr 13 2012 *)

Formula

a(n) = n^4 - A211809(n).

A005917 Rhombic dodecahedral numbers: a(n) = n^4 - (n - 1)^4.

Original entry on oeis.org

1, 15, 65, 175, 369, 671, 1105, 1695, 2465, 3439, 4641, 6095, 7825, 9855, 12209, 14911, 17985, 21455, 25345, 29679, 34481, 39775, 45585, 51935, 58849, 66351, 74465, 83215, 92625, 102719, 113521, 125055, 137345, 150415, 164289, 178991
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

Final digits of a(n), i.e., a(n) mod 10, are repeated periodically with period of length 5 {1,5,5,5,9}. There is a symmetry in this list since the sum of two numbers equally distant from the ends is equal to 10 = 1 + 9 = 5 + 5 = 2*5. Last two digits of a(n), i.e., a(n) mod 100, are repeated periodically with period of length 50. - Alexander Adamchuk, Aug 11 2006
a(n) = VarScheme(n,2) in the scheme displayed in A128195. - Peter Luschny, Feb 26 2007
If Y is a 3-subset of a 2n-set X then, for n >= 2, a(n-2) is the number of 4-subsets of X intersecting Y. - Milan Janjic, Nov 18 2007
The numbers are the constant number found in magic squares of order n, where n is an odd number, see the comment in A006003. A Magic Square of side 1 is 1; 3 is 15; 5 is 65 and so on. - David Quentin Dauthier, Nov 07 2008
Two times the area of the triangle with vertices at (0,0), ((n - 1)^2, n^2), and (n^2, (n - 1)^2). - J. M. Bergot, Jun 25 2013
Bisection of A006003. - Omar E. Pol, Sep 01 2018
Construct an array M with M(0,n) = 2*n^2 + 4*n + 1 = A056220(n+1), M(n,0) = 2*n^2 + 1 = A058331(n) and M(n,n) = 2*n*(n+1) + 1 = A001844(n). Row(n) begins with all the increasing odd numbers from A058331(n) to A001844(n) and column(n) begins with all the decreasing odd numbers from A056220(n+1) to A001844(n). The sum of the terms in row(n) plus those in column(n) minus M(n,n) equals a(n+1). The first five rows of array M are [1, 7, 17, 31, 49, ...]; [3, 5, 15, 29, 47, ...]; [9, 11, 13, 27, 45, ...]; [19, 21, 23, 25, 43, ...]; [33, 35, 37, 39, 41, ...]. - J. M. Bergot, Jul 16 2013 [This contribution was moved here from A047926 by Petros Hadjicostas, Mar 08 2021.]
For n>=2, these are the primitive sides s of squares of type 2 described in A344332. - Bernard Schott, Jun 04 2021
(a(n) + 1) / 2 = A212133(n) is the number of cells in the n-th rhombic-dodecahedral polycube. - George Sicherman, Jan 21 2024

References

  • J. H. Conway and R. K. Guy, The Book of Numbers, p. 53.
  • E. Deza and M. M. Deza, Figurate Numbers, World Scientific Publishing, 2012, pp. 123-124.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

(1/12)*t*(2*n^3 - 3*n^2 + n) + 2*n - 1 for t = 2, 4, 6, ... gives A049480, A005894, A063488, A001845, A063489, A005898, A063490, A057813, A063491, A005902, A063492, A063493, A063494, A063495, A063496.
Column k=3 of A047969.
Cf. A128195, A176850, A005408, A176271, A212133.
Cf. A001844, A000583, A000290.
Cf. A007588, A000292, A000332, A002817, A342354.
Cf. A031215, A008292.
Cf. A016754, A344330, A344332.

Programs

  • Haskell
    a005917 n = a005917_list !! (n-1)
a005917_list = map sum $ f 1 [1, 3 ..] where
   f x ws = us : f (x + 2) vs where (us, vs) = splitAt x ws
-- Reinhard Zumkeller, Nov 13 2014
  • Magma
    [n^4 - (n-1)^4: n in [1..50]]; // Vincenzo Librandi, Aug 01 2011
  • Mathematica
    Table[n^4-(n-1)^4,{n,40}]  (* Harvey P. Dale, Apr 01 2011 *)
#[[2]]-#[[1]]&/@Partition[Range[0,40]^4,2,1] (* More efficient than the above Mathematica program because it only has to calculate each 4th power once *) (* Harvey P. Dale, Feb 07 2015 *)
Differences[Range[0,40]^4] (* Harvey P. Dale, Aug 11 2023 *)
  • PARI
    a(n)=n^4-(n-1)^4 \\ Charles R Greathouse IV, Jul 31 2011
  • Python
    A005917_list, m = [], [24, -12, 2, 1]
for _ in range(10**2):
    A005917_list.append(m[-1])
    for i in range(3):
        m[i+1] += m[i] # Chai Wah Wu, Dec 15 2015

Formula

a(n) = (2*n - 1)*(2*n^2 - 2*n + 1).
Sum_{i=1..n} a(i) = n^4 = A000583(n). First differences of A000583.
G.f.: x*(1+x)*(1+10*x+x^2)/(1-x)^4. - Simon Plouffe in his 1992 dissertation
More generally, g.f. for n^m - (n - 1)^m is Euler(m, x)/(1 - x)^m, where Euler(m, x) is Eulerian polynomial of degree m (cf. A008292). E.g.f.: x*(exp(y/(1 - x)) - exp(x*y/(1 - x)))/(exp(x*y/(1 - x))-x*exp(y/(1 - x))). - Vladeta Jovovic, May 08 2002
a(n) = sum of the next (2*n - 1) odd numbers; i.e., group the odd numbers so that the n-th group contains (2*n - 1) elements like this: (1), (3, 5, 7), (9, 11, 13, 15, 17), (19, 21, 23, 25, 27, 29, 31), ... E.g., a(3) = 65 because 9 + 11 + 13 + 15 + 17 = 65. - Xavier Acloque, Oct 11 2003
a(n) = 2*n - 1 + 12*Sum_{i = 1..n} (i - 1)^2. - Xavier Acloque, Oct 16 2003
a(n) = (4*binomial(n,2) + 1)*sqrt(8*binomial(n,2) + 1). - Paul Barry, Mar 14 2004
Binomial transform of [1, 14, 36, 24, 0, 0, 0, ...], if the offset is 0. - Gary W. Adamson, Dec 20 2007
Sum_{i=1..n-1}(a(i) + a(i+1)) = 8*Sum_{i=1..n}(i^3 + i) = 16*A002817(n-1) for n > 1. - Bruno Berselli, Mar 04 2011
a(n+1) = a(n) + 2*(6*n^2 + 1) = a(n) + A005914(n). - Vincenzo Librandi, Mar 16 2011
a(n) = -a(-n+1). a(n) = (1/6)*(A181475(n) - A181475(n-2)). - Bruno Berselli, Sep 26 2011
a(n) = A045975(2*n-1,n) = A204558(2*n-1)/(2*n - 1). - Reinhard Zumkeller, Jan 18 2012
a(n+1) = Sum_{k=0..2*n+1} (A176850(n,k) - A176850(n-1,k))*(2*k + 1), n >= 1. - L. Edson Jeffery, Nov 02 2012
a(n) = A005408(n-1) * A001844(n-1) = (2*(n - 1) + 1) * (2*(n - 1)*n + 1) = A000290(n-1)*12 + 2 + a(n-1). - Bruce J. Nicholson, May 17 2017
a(n) = A007588(n) + A007588(n-1) = A000292(2n-1) + A000292(2n-2) + A000292(2n-3) = A002817(2n-1) - A002817(2n-2). - Bruce J. Nicholson, Oct 22 2017
a(n) = A005898(n-1) + 6*A000330(n-1) (cf. Deza, Deza, 2012, p. 123, Section 2.6.2). - Felix Fröhlich, Oct 01 2018
a(n) = A300758(n-1) + A005408(n-1). - Bruce J. Nicholson, Apr 23 2020
G.f.: polylog(-4, x)*(1-x)/x. See the Simon Plouffe formula above (with expanded numerator), and the g.f. of the rows of A008292 by Vladeta Jovovic, Sep 02 2002. - Wolfdieter Lang, May 10 2021

A247533 T(n,k)=Number of length n+3 0..k arrays with some disjoint pairs in every consecutive four terms having the same sum.

Original entry on oeis.org

8, 33, 8, 88, 45, 8, 185, 136, 61, 8, 336, 317, 220, 81, 8, 553, 600, 561, 364, 105, 8, 848, 1033, 1124, 1007, 604, 153, 8, 1233, 1616, 2009, 2164, 1823, 1018, 217, 8, 1720, 2409, 3220, 3997, 4228, 3455, 1732, 297, 8, 2321, 3400, 4901, 6584, 8051, 8440, 6495, 2956
Offset: 1

Views

Author

R. H. Hardin, Sep 18 2014

Keywords

Comments

Table starts
.8..33...88...185....336....553....848....1233....1720....2321....3048....3913
.8..45..136...317....600...1033...1616....2409....3400....4661....6168....8005
.8..61..220...561...1124...2009...3220....4901....7016....9737...13000...17025
.8..81..364..1007...2164...3997...6584...10219...14852...20847...28108...37095
.8.105..604..1823...4228...8051..13668...21609...31924...45309...61740...82067
.8.153.1018..3455...8440..16683..29012...47061...70374..101211..139098..186709
.8.217.1732..6495..16932..34695..62108..103013..156308..227701..316236..428111
.8.297.2956.12105..34068..72269.133716..226309..349160..515043..723892..987667
.8.393.5050.22459..68688.150677.288996..498569..783568.1170169.1665908.2290065
.8.585.8638.43255.139040.318575.627654.1111891.1772920.2686215.3862654.5366083

Examples

			Some solutions for n=6 k=4
..2....3....2....1....4....3....3....0....2....1....0....3....1....4....1....1
..1....2....1....2....1....2....2....1....4....1....0....0....3....2....2....4
..0....3....3....2....0....2....2....2....3....2....1....2....4....1....1....1
..3....2....2....1....3....1....3....3....1....2....1....1....2....3....2....4
..4....3....2....3....2....1....3....0....2....3....2....1....3....2....3....1
..1....2....3....2....1....2....4....1....2....1....0....2....3....4....4....4
..2....3....3....2....2....2....2....2....3....0....1....0....4....3....3....1
..3....4....4....1....3....3....3....1....1....2....3....1....4....3....2....4
..4....1....2....3....4....3....1....0....2....3....4....1....3....4....1....1

Links

Crossrefs

Row 1 is A212133(n+1)

Formula

Empirical for column k:
k=1: a(n) = a(n-1)
k=2: a(n) = a(n-1) +4*a(n-4) -4*a(n-5)
k=3: a(n) = 2*a(n-1) -a(n-3) +a(n-4) -a(n-5) -a(n-6) +a(n-7)
k=4: [order 29] for n>30
k=5: [order 56]
k=6: [order 82] for n>84
Empirical for row n:
n=1: a(n) = 2*n^3 + 3*n^2 + 2*n + 1
n=2: a(n) = 2*a(n-1) +a(n-2) -4*a(n-3) +a(n-4) +2*a(n-5) -a(n-6); also a polynomial of degree 3 plus a linear quasipolynomial with period 2
n=3: [recurrence of order 12; also a polynomial of degree 3 plus a linear quasipolynomial with period 12]
n=4: [recurrence of order 24; also a polynomial of degree 3 plus a linear quasipolynomial with period 420]
n=5: [recurrence of order 48; also a polynomial of degree 3 plus a linear quasipolynomial with period 27720; note 2 12 420 27720 matches A060942]
n=6: [recurrence of order 92]

A226449 a(n) = n*(5*n^2-8*n+5)/2.

Original entry on oeis.org

0, 1, 9, 39, 106, 225, 411, 679, 1044, 1521, 2125, 2871, 3774, 4849, 6111, 7575, 9256, 11169, 13329, 15751, 18450, 21441, 24739, 28359, 32316, 36625, 41301, 46359, 51814, 57681, 63975, 70711, 77904, 85569, 93721, 102375, 111546, 121249, 131499, 142311, 153700
Offset: 0

Views

Author

Bruno Berselli, Jun 07 2013

Keywords

Comments

Sequences of the type b(m)+m*b(m-1), where b is a polygonal number:
A006003(n) = A000217(n) + n*A000217(n-1) (b = triangular numbers);
A069778(n) = A000290(n+1) + (n+1)*A000290(n) (b = square numbers);
A143690(n) = A000326(n+1) + (n+1)*A000326(n) (b = pentagonal numbers);
A212133(n) = A000384(n) + n*A000384(n-1) (b = hexagonal numbers);
a(n) = A000566(n) + n*A000566(n-1) (b = heptagonal numbers);
A226450(n) = A000567(n) + n*A000567(n-1) (b = octagonal numbers);
A226451(n) = A001106(n) + n*A001106(n-1) (b = nonagonal numbers);
A204674(n) = A001107(n+1) + (n+1)*A001107(n) (b = decagonal numbers).

Links

Crossrefs

Cf. (see the comment) A000566, A006003, A069778, A143690, A204674, A212133, A226450, A226451.

Programs

  • Magma
    [n*(5*n^2-8*n+5)/2: n in [0..40]];
  • Magma
    I:=[0,1,9,39]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..45]]; // Vincenzo Librandi, Aug 18 2013
  • Mathematica
    Table[n (5 n^2 - 8 n + 5)/2, {n, 0, 40}]
CoefficientList[Series[x (1 + 5 x + 9 x^2)/(1 - x)^4, {x, 0, 45}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{4,-6,4,-1},{0,1,9,39},50] (* Harvey P. Dale, May 19 2017 *)
  • PARI
    a(n)=n*(5*n^2-8*n+5)/2 \\ Charles R Greathouse IV, Oct 07 2015

Formula

G.f.: x*(1+5*x+9*x^2)/(1-x)^4.
a(n) - a(-n) = A008531(n) for n>0.

A178465 Expansion of -2*x^2*(-3-2*x+x^2-x^3-2*x^4+x^5) / ( (1+x)^2*(x-1)^4 ).

Original entry on oeis.org

0, 0, 6, 16, 36, 66, 114, 176, 264, 370, 510, 672, 876, 1106, 1386, 1696, 2064, 2466, 2934, 3440, 4020, 4642, 5346, 6096, 6936, 7826, 8814, 9856, 11004, 12210, 13530, 14912, 16416, 17986, 19686, 21456, 23364, 25346, 27474, 29680, 32040, 34482
Offset: 0

Views

Author

Sean A. Irvine, Mar 23 2011

Keywords

Crossrefs

Cf. A187062, A187397, A061804, A018808.

Programs

  • Mathematica
    CoefficientList[ Series[ 2x^2 (3 + 2x - x^2 + x^3 + 2x^4 - x^5)/((1 + x)^2 (x - 1)^4), {x, 0, 42}], x] (* Robert G. Wilson v, Feb 17 2014 *)
  • Python
    def A178465(n): return n+(m:=n&1)+(n*(n**2-m)>>1) if n != 1 else 0 # Chai Wah Wu, Aug 30 2022

Formula

For n even, a(n) = n*(2+n^2)/2 = A061804(n/2). For n>1 and odd, a(n)=(n+1)*(n^2-n+2)/2 = 2*A212133((n+1)/2).
a(n) = (2-2*(-1)^n+(3+(-1)^n)*n+2*n^3)/4 for n>1. [Colin Barker, Feb 18 2013]

Extensions

Discrepancy with A018808 resolved. David W. Wilson, Aug 05 2013
First line of formulas corrected. R. J. Mathar, Aug 05 2013
Prepended a(0)=0, Joerg Arndt, Feb 19 2014

A212134 Number of (w,x,y,z) with all terms in {1,...,n} and median<=mean.

Original entry on oeis.org

0, 1, 12, 57, 172, 405, 816, 1477, 2472, 3897, 5860, 8481, 11892, 16237, 21672, 28365, 36496, 46257, 57852, 71497, 87420, 105861, 127072, 151317, 178872, 210025, 245076, 284337, 328132, 376797, 430680, 490141, 555552, 627297, 705772, 791385, 884556, 985717
Offset: 0

Views

Author

Clark Kimberling, May 04 2012

Keywords

Comments

Also, the number of (w,x,y,z) with all terms in {1,...,n} and median>=mean.
For a guide to related sequences, see A211795.

Links

Crossrefs

Cf. A211795, A212133.

Programs

  • Mathematica
    t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[Apply[Plus, Rest[Most[Sort[{w, x, y, z}]]]]/2 <= (w + x + y + z)/4, s = s + 1], {w, 1, #}, {x, 1, #}, {y, 1, #},
{z, 1, #}] &[n]; s)]];
Flatten[Map[{t[#]} &, Range[0, 50]]]  (* A212134 *)
(* Peter J. C. Moses, May 01 2012 *)
  • PARI
    concat(0, Vec(x*(1 + 7*x + 7*x^2 - 3*x^3) /(1 - x)^5 + O(x^40))) \\ Colin Barker, Dec 02 2017

Formula

a(n)+ A212135(n) = n^4.
a(n) = n*(n^3 + 2*n^2 - 3*n + 2)/2.
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5).
G.f.: x*(1 + 7*x + 7*x^2 - 3*x^3) /(1 - x)^5. - Colin Barker, Dec 02 2017
E.g.f.: exp(x)*x*(2 + 10*x + 8*x^2 + x^3)/2. - Stefano Spezia, Aug 08 2025

A226450 a(n) = n*(3*n^2 - 5*n + 3).

Original entry on oeis.org

0, 1, 10, 45, 124, 265, 486, 805, 1240, 1809, 2530, 3421, 4500, 5785, 7294, 9045, 11056, 13345, 15930, 18829, 22060, 25641, 29590, 33925, 38664, 43825, 49426, 55485, 62020, 69049, 76590, 84661, 93280, 102465, 112234, 122605, 133596, 145225, 157510, 170469
Offset: 0

Views

Author

Bruno Berselli, Jun 07 2013

Keywords

Comments

See the comment in A226449.
For n >= 3, also the detour index of the n-barbell graph. - Eric W. Weisstein, Dec 20 2017

Links

Crossrefs

Cf. A000567.
Similar sequences of the type b(m)+m*b(m-1), where b is a polygonal number: A006003, A069778, A143690, A204674, A212133, A226449, A226451.

Programs

  • Magma
    [n*(3*n^2-5*n+3): n in [0..40]];
  • Magma
    I:=[0,1,10,45]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..45]]; // Vincenzo Librandi, Aug 18 2013
  • Mathematica
    Table[n (3 n^2 - 5 n + 3), {n, 0, 40}]
CoefficientList[Series[x (1 + 6 x + 11 x^2)/(1 - x)^4, {x, 0, 40}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{4, -6, 4, -1}, {1, 10, 45, 124}, {0, 20}] (* Eric W. Weisstein, Dec 20 2017 *)
  • PARI
    a(n) = n*(3*n^2 - 5*n + 3); \\ Altug Alkan, Dec 20 2017

Formula

G.f.: x*(1+6*x+11*x^2)/(1-x)^4.
a(n) = A000567(n) + n*A000567(n-1).

A226451 a(n) = n*(7*n^2-12*n+7)/2.

Original entry on oeis.org

0, 1, 11, 51, 142, 305, 561, 931, 1436, 2097, 2935, 3971, 5226, 6721, 8477, 10515, 12856, 15521, 18531, 21907, 25670, 29841, 34441, 39491, 45012, 51025, 57551, 64611, 72226, 80417, 89205, 98611, 108656, 119361, 130747, 142835, 155646, 169201, 183521
Offset: 0

Views

Author

Bruno Berselli, Jun 07 2013

Keywords

Comments

See the comment in A226449.

Links

Crossrefs

Cf. A001106.
Similar sequences of the type b(m)+m*b(m-1), where b is a polygonal number: A006003, A069778, A143690, A204674, A212133, A226449, A226450.

Programs

  • Magma
    [n*(7*n^2-12*n+7)/2: n in [0..40]];
  • Magma
    I:=[0,1,11,51]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..40]]; // Vincenzo Librandi, Aug 18 2013
  • Mathematica
    Table[n (7 n^2 - 12 n + 7)/2, {n, 0, 40}]
CoefficientList[Series[x (1 + 7 x + 13 x^2)/(1 - x)^4, {x, 0, 40}], x] (* Vincenzo Librandi, Aug 18 2013 *)

Formula

G.f.: x*(1+7*x+13*x^2)/(1-x)^4.
a(n) = A001106(n) + n*A001106(n-1).
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n >= 4. - Wesley Ivan Hurt, Oct 15 2023
Showing 1-8 of 8 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.