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.

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n*(n+m) and odd-numbered rows are of the form n*(n+m)/2.

Original entry on oeis.org

1, 3, 3, 6, 8, 2, 10, 15, 5, 5, 15, 24, 9, 12, 3, 21, 35, 14, 21, 7, 7, 28, 48, 20, 32, 12, 16, 4, 36, 63, 27, 45, 18, 27, 9, 9, 45, 80, 35, 60, 25, 40, 15, 20, 5, 55, 99, 44, 77, 33, 55, 22, 33, 11, 11, 66, 120, 54, 96, 42, 72, 30, 48, 18, 24, 6, 78, 143, 65, 117, 52, 91, 39, 65, 26, 39, 13, 13
Offset: 1

Views

Author

Eugene McDonnell (eemcd(AT)mac.com), Nov 02 2004

Keywords

Comments

The rows of this table and that in A098737 are related. Given a function f = n/( 1 + (1+n) mod(2) ), row n of A098737 can be derived from row n of T by multiplying the latter by f(n); row n of T can be derived from row n of A098737 by dividing the latter by f(n).

Examples

			Array begins as:
  1,  3,  6, 10, 15, 21,  28,  36,  45 ... A000217;
  3,  8, 15, 24, 35, 48,  63,  80,  99 ... A005563;
  2,  5,  9, 14, 20, 27,  35,  44,  54 ... A000096;
  5, 12, 21, 32, 45, 60,  77,  96, 117 ... A028347;
  3,  7, 12, 18, 25, 33,  42,  52,  63 ... A027379;
  7, 16, 27, 40, 55, 72,  91, 112, 135 ... A028560;
  4,  9, 15, 22, 30, 39,  49,  60,  72 ... A055999;
  9, 20, 33, 48, 65, 84, 105, 128, 153 ... A028566;
  5, 11, 18, 26, 35, 45,  56,  68,  81 ... A056000;
Antidiagonals begin as:
   1;
   3,  3;
   6,  8,  2;
  10, 15,  5,  5;
  15, 24,  9, 12,  3;
  21, 35, 14, 21,  7,  7;
  28, 48, 20, 32, 12, 16,  4;
  36, 63, 27, 45, 18, 27,  9,  9;
  45, 80, 35, 60, 25, 40, 15, 20,  5;
  55, 99, 44, 77, 33, 55, 22, 33, 11, 11;
		

Crossrefs

Row m of array: A000217 (m=1), A005563 (m=2), A000096 (m=3), A028347 (m=4), A027379 (m=5), A028560 (m=6), A055999 (m=7), A028566 (m=8), A056000 (m=9), A098603 (m=10), A056115 (m=11), A098847 (m=12), A056119 (m=13), A098848 (m=14), A056121 (m=15), A098849 (m=16), A056126 (m=17), A098850 (m=18), A051942 (m=19).
Column m of array: A026741 (m=1), A022998 (m=2), A165351 (m=3).

Programs

  • Magma
    A098832:= func< n,k | (1/4)*(3+(-1)^k)*(n+1)*(n-k+1) >;
    [A098832(n,k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 31 2022
    
  • Mathematica
    A098832[n_, k_]:= (1/4)*(3+(-1)^k)*(n+1)*(n-k+1);
    Table[A098832[n,k], {n,15}, {k,n}]//Flatten (* G. C. Greubel, Jul 31 2022 *)
  • SageMath
    def A098832(n,k): return (1/4)*(3+(-1)^k)*(n+1)*(n-k+1)
    flatten([[A098832(n,k) for k in (1..n)] for n in (1..15)]) # G. C. Greubel, Jul 31 2022

Formula

Item m of row n of T is given (in infix form) by: n T m = n * (n + m) / (1 + m (mod 2)). E.g. Item 4 of row 3 of T: 3 T 4 = 14.
From G. C. Greubel, Jul 31 2022: (Start)
A(n, k) = (1/4)*(3 + (-1)^n)*k*(k+n) (array).
T(n, k) = (1/4)*(3 + (-1)^k)*(n+1)*(n-k+1) (antidiagonal triangle).
Sum_{k=1..n} T(n, k) = (1/8)*(n+1)*( (3*n-1)*(n+1) + (1+(-1)^n)/2 ).
T(2*n-1, n) = A181900(n).
T(2*n+1, n) = 2*A168509(n+1). (End)

Extensions

Missing terms added by G. C. Greubel, Jul 31 2022

A244082 a(n) = 32*n^2.

Original entry on oeis.org

0, 32, 128, 288, 512, 800, 1152, 1568, 2048, 2592, 3200, 3872, 4608, 5408, 6272, 7200, 8192, 9248, 10368, 11552, 12800, 14112, 15488, 16928, 18432, 20000, 21632, 23328, 25088, 26912, 28800, 30752, 32768, 34848, 36992, 39200, 41472, 43808, 46208, 48672, 51200
Offset: 0

Views

Author

Wesley Ivan Hurt, Jun 19 2014

Keywords

Comments

Geometric connections of a(n) to the area and perimeter of a square.
Area:
. half the area of a square with side 8n (cf. A008590);
. area of a square with diagonal 8n (cf. A008590);
. twice the area of a square with side 4n (cf. A008586);
. four times the area of a square with diagonal 4n (cf. A008586);
. eight times the area of a square with side 2n (cf. A005843);
. sixteen times the area of a square with diagonal 2n (cf. A005843);
. thirty two times the area of a square with side n (cf. A001477);
. sixty four times the area of a square with diagonal n (cf. A001477).
Perimeter:
. perimeter of a square with side 8n^2 (cf. A139098);
. twice the perimeter of a square with side 4n^2 (cf. A016742);
. four times the perimeter of a square with side 2n^2 (cf. A001105);
. eight times the perimeter of a square with side n^2 (cf. A000290).
Sequence found by reading the line from 0, in the direction 0, 32, ..., in the square spiral whose vertices are the generalized 18-gonal numbers. - Omar E. Pol, May 10 2018

Crossrefs

Programs

  • Magma
    [32*n^2 : n in [0..50]];
    
  • Maple
    A244082:=n->32*n^2; seq(A244082(n), n=0..50);
  • Mathematica
    32 Range[0, 50]^2 (* or *)
    Table[32 n^2, {n, 0, 50}] (* or *)
    CoefficientList[Series[32 x (1 + x)/(1 - x)^3, {x, 0, 30}], x]
  • PARI
    a(n)=32*n^2 \\ Charles R Greathouse IV, Jun 17 2017

Formula

G.f.: 32*x*(1+x)/(1-x)^3.
a(n) = 2 * A016802(n).
a(n) = 4 * A139098(n).
a(n) = 8 * A016742(n).
a(n) = 16 * A001105(n).
a(n) = 32 * A000290(n).
a(n) = A010021(n) - 2 for n > 0. - Bruno Berselli, Jun 24 2014
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Wesley Ivan Hurt, Nov 19 2021
From Elmo R. Oliveira, Dec 02 2024: (Start)
E.g.f.: 32*x*(1 + x)*exp(x).
a(n) = n*A174312(n) = A139098(2*n). (End)

A086500 Group the natural numbers such that the n-th group sum is divisible by the n-th triangular number: (1), (2, 3, 4), (5, 6, 7), (8, 9, 10, 11, 12), (13, 14, 15, 16, 17), (18, 19, 20, 21, 22, 23, 24), ... Sequence contains the group sum.

Original entry on oeis.org

1, 9, 18, 50, 75, 147, 196, 324, 405, 605, 726, 1014, 1183, 1575, 1800, 2312, 2601, 3249, 3610, 4410, 4851, 5819, 6348, 7500, 8125, 9477, 10206, 11774, 12615, 14415, 15376, 17424, 18513, 20825, 22050, 24642, 26011, 28899, 30420, 33620, 35301
Offset: 1

Views

Author

Amarnath Murthy, Jul 28 2003

Keywords

Comments

The number of terms in the groups is given by A063196. i.e., 1, 3, 3, 5, 5, 7, 7, 9, 9, 11, 11, ...
Also the arithmetic mean of the n-th group is T(n), the n-th triangular number.

Crossrefs

Programs

  • Haskell
    a086500 n = a086500_list !! (n-1)
    a086500_list = scanl1 (+) $ tail a181900_list
    -- Reinhard Zumkeller, Mar 31 2012
    
  • Mathematica
    Table[n*(n + 1)*(2*n + 1 + (-1)^n)/4, {n, 1, 40}] (* Amiram Eldar, Feb 22 2022 *)
  • PARI
    Vec(x*(x^4+8*x^3+6*x^2+8*x+1)/((x-1)^4*(x+1)^3) + O(x^100)) \\ Colin Barker, Sep 20 2014

Formula

a(n) = n*(n+1)*(2*n+1+(-1)^n)/4. - Wesley Ivan Hurt, Sep 19 2014
a(n) = a(n-1)+3*a(n-2)-3*a(n-3)-3*a(n-4)+3*a(n-5)+a(n-6)-a(n-7) for n>7. - Colin Barker, Sep 19 2014
G.f.: x*(x^4+8*x^3+6*x^2+8*x+1) / ((x-1)^4*(x+1)^3). - Colin Barker, Sep 19 2014
From Amiram Eldar, Feb 22 2022: (Start)
Sum_{n>=1} 1/a(n) = 4*(1-log(2)).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/2 - 4. (End)

Extensions

More terms from Ray Chandler, Sep 17 2003

A251091 a(n) = n^2 / gcd(n+2, 4).

Original entry on oeis.org

0, 1, 1, 9, 8, 25, 9, 49, 32, 81, 25, 121, 72, 169, 49, 225, 128, 289, 81, 361, 200, 441, 121, 529, 288, 625, 169, 729, 392, 841, 225, 961, 512, 1089, 289, 1225, 648, 1369, 361, 1521, 800, 1681, 441, 1849, 968, 2025, 529, 2209, 1152, 2401, 625, 2601, 1352
Offset: 0

Views

Author

Paul Curtz, May 08 2015

Keywords

Comments

A061038(n), which appears in 4*a(n) formula, is a permutation of n^2.
Origin. In December 2010, I wrote in my 192-page Exercise Book no. 5, page 41, the array (difference table of the first row):
1 0, 1/3, 1, 9/5, 8/3, 25/7, 9/2, 49/9, ...
-1, 1/3, 2/3, 4/5, 13/15, 19/21, 13/14, 17/18, 43/45, ...
Numerators are listed in A176126, denominators are in A064038, and denominator - numerator = 2, 2, 1, 1,... (A014695).
4/3, 1/3, 2/15, 1/15, 4/105, 1/42, 1/63, 1/90, 4/495, ...
-1, -1/5, -1/15, -1/35, -1/70, -1/126, -1/210, -1/330, -1/495, ...
where the denominators of the second row are listed in A000332.
Also for those of the inverse binomial transform
1, -1, 4/3, -1, 4/5, -2/3, 4/7, -1/2, 4/9, -2/5, 4/11, -1/3, ... ?
a(n) is the (n+1)-th term of the numerators of the first row.

Examples

			a(0) = 0/2, a(1) = 1/1, a(2) = 4/4, a(3) = 9/1.
		

Crossrefs

Programs

  • Magma
    [(1-(1/16)*(1+(-1)^n)*(5-(-1)^(n div 2)) )*n^2: n in [0..60]]; // Vincenzo Librandi, Jun 12 2015
  • Maple
    seq(seq((4*i+j-1)^2/[2,1,4,1][j],j=1..4),i=0..30); # Robert Israel, May 14 2015
  • Mathematica
    f[n_] := Switch[ Mod[n, 4], 0, n^2/2, 1, n^2, 2, n^2/4, 3, n^2]; Array[f, 50, 0] (* or *) Table[(4 i + j - 1)^2/{2, 1, 4, 1}[[j]], {i, 0, 12}, {j, 4}] // Flatten (* after Robert Israel *) (* or *) LinearRecurrence[{0, 0, 0, 3, 0, 0, 0, -3, 0, 0, 0, 1}, {0, 1, 1, 9, 8, 25, 9, 49, 32, 81, 25, 121}, 53] (* or *) CoefficientList[ Series[-((x (1 + x (1 + x (9 + x (8 + x (22 + x (6 + x (22 + x (8 + x (9 + x + x^2))))))))))/(-1 + x^4)^3), {x, 0, 52}], x] (* Robert G. Wilson v, May 19 2015 *)
  • PARI
    concat(0, Vec(-x*(x^10 + x^9 + 9*x^8 + 8*x^7 + 22*x^6 + 6*x^5 + 22*x^4 + 8*x^3 + 9*x^2 + x + 1) / ((x-1)^3*(x+1)^3*(x^2+1)^3) + O(x^100))) \\ Colin Barker, May 14 2015
    

Formula

a(n) = n^2/(period 4: repeat 2, 1, 4, 1).
a(4n) = 8*n^2, a(2n+1) = a(4n+2) = (2*n+1)^2.
a(n+4) = a(n) + 8*A060819(n).
a(n) = 3*a(n-4) - 3*a(n-8) + a(n-12), n>11.
4*a(n) = (period 4: repeat 2, 1, 4, 1) * A061038(n).
G.f.: -x*(x^10+x^9+9*x^8+8*x^7+22*x^6+6*x^5+22*x^4+8*x^3+9*x^2+x+1) / ((x-1)^3*(x+1)^3*(x^2+1)^3). - Colin Barker, May 14 2015
a(2n) = A181900(n), a(2n+1) = A016754(n). [Bruno Berselli, May 14 2015]
a(n) = ( 1 - (1/16)*(1+(-1)^n)*(5-(-1)^(n/2)) )*n^2. - Bruno Berselli, May 14 2015
Sum_{n>=1} 1/a(n) = 13*Pi^2/48. - Amiram Eldar, Aug 12 2022

Extensions

Missing term (1521) inserted in the sequence by Colin Barker, May 14 2015
Definition uses a formula by Jean-François Alcover, Jul 01 2015
Keyword:mult added by Andrew Howroyd, Aug 06 2018
Showing 1-4 of 4 results.