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

A272214 Square array read by antidiagonals upwards in which T(n,k) is the product of the n-th prime and the sum of the divisors of k, n >= 1, k >= 1.

Original entry on oeis.org

2, 3, 6, 5, 9, 8, 7, 15, 12, 14, 11, 21, 20, 21, 12, 13, 33, 28, 35, 18, 24, 17, 39, 44, 49, 30, 36, 16, 19, 51, 52, 77, 42, 60, 24, 30, 23, 57, 68, 91, 66, 84, 40, 45, 26, 29, 69, 76, 119, 78, 132, 56, 75, 39, 36, 31, 87, 92, 133, 102, 156, 88, 105, 65, 54, 24, 37, 93, 116, 161, 114, 204, 104, 165, 91, 90, 36, 56
Offset: 1

Views

Author

Omar E. Pol, Apr 28 2016

Keywords

Comments

From Omar E. Pol, Dec 21 2021: (Start)
Also triangle read by rows: T(n,j) = A000040(n-j+1)*A000203(j), 1 <= j <= n.
For a visualization of T(n,j) first consider a tower (a polycube) in which the terraces are the symmetric representation of sigma(j), for j = 1 to n, starting from the top, and the heights of the terraces are the first n prime numbers respectively starting from the base. Then T(n,j) can be represented with a set of A237271(j) right prisms of height A000040(n-j+1) since T(n,j) is also the total number of cubes that are exactly below the parts of the symmetric representation of sigma(j) in the tower.
The sum of the n-th row of triangle is A086718(n) equaling the volume of the tower whose largest side of the base is n and its total height is the n-th prime.
The tower is an member of the family of the stepped pyramids described in A245092 and of the towers described in A221529. That is an infinite family of symmetric polycubes whose volumes represent the convolution of A000203 with any other integer sequence. (End)

Examples

			The corner of the square array begins:
   2,  6,   8,  14,  12,  24,  16,  30,  26,  36, ...
   3,  9,  12,  21,  18,  36,  24,  45,  39,  54, ...
   5, 15,  20,  35,  30,  60,  40,  75,  65,  90, ...
   7, 21,  28,  49,  42,  84,  56, 105,  91, 126, ...
  11, 33,  44,  77,  66, 132,  88, 165, 143, 198, ...
  13, 39,  52,  91,  78, 156, 104, 195, 169, 234, ...
  17, 51,  68, 119, 102, 204, 136, 255, 221, 306, ...
  19, 57,  76, 133, 114, 228, 152, 285, 247, 342, ...
  23, 69,  92, 161, 138, 276, 184, 345, 299, 414, ...
  29, 87, 116, 203, 174, 348, 232, 435, 377, 522, ...
  ...
From _Omar E. Pol_, Dec 21 2021: (Start)
Written as a triangle the sequence begins:
   2;
   3,  6;
   5,  9,  8;
   7, 15, 12,  14;
  11, 21, 20,  21,  12;
  13, 33, 28,  35,  18,  24;
  17, 39, 44,  49,  30,  36, 16;
  19, 51, 52,  77,  42,  60, 24,  30;
  23, 57, 68,  91,  66,  84, 40,  45, 26;
  29, 69, 76, 119,  78, 132, 56,  75, 39, 36;
  31, 87, 92, 133, 102, 156, 88, 105, 65, 54, 24;
...
Row sums give A086718. (End)

Links

Crossrefs

Rows 1-4 of the square array: A074400, A272027, A274535, A319527.
Columns 1-5 of the square array: A000040, A001748, A001749, A138636, A272470.
Main diagonal of the square array gives A272211.
Cf. A086718 (antidiagonal sums of the square array, row sums of the triangle).
Cf. A000203, A221529, A237270, A237271, A237593, A245092, A272173, A272400, A274824.

Programs

  • Mathematica
    Table[Prime[#] DivisorSigma[1, k] &@(n - k + 1), {n, 12}, {k, n}] // Flatten (* Michael De Vlieger, Apr 28 2016 *)

Formula

T(n,k) = prime(n)*sigma(k) = A000040(n)*A000203(k), n >= 1, k >= 1.
T(n,k) = A272400(n+1,k).

A112773 3 together with primes multiplied by 3.

Original entry on oeis.org

3, 6, 9, 15, 21, 33, 39, 51, 57, 69, 87, 93, 111, 123, 129, 141, 159, 177, 183, 201, 213, 219, 237, 249, 267, 291, 303, 309, 321, 327, 339, 381, 393, 411, 417, 447, 453, 471, 489, 501, 519, 537, 543, 573, 579, 591, 597, 633, 669, 681, 687, 699, 717, 723, 753
Offset: 1

Views

Author

Jonathan Vos Post and Ray Chandler, Oct 15 2005

Keywords

Comments

3 times the noncomposite numbers (see formula). Also column 2 of A272400. - Omar E. Pol, Apr 29 2016

Links

Crossrefs

Essentially the same as A001748.
Cf. A000040, A001747, A008578, A008585, A046315.

Programs

Formula

a(n) = 3*A008578(n). - Omar E. Pol, Jan 31 2012

Extensions

Edited by N. J. A. Sloane, Apr 28 2008 at the suggestion of Alexander R. Povolotsky

A272211 Product of n-th prime and the sum of the divisors of n.

Original entry on oeis.org

2, 9, 20, 49, 66, 156, 136, 285, 299, 522, 372, 1036, 574, 1032, 1128, 1643, 1062, 2379, 1340, 2982, 2336, 2844, 1992, 5340, 3007, 4242, 4120, 5992, 3270, 8136, 4064, 8253, 6576, 7506, 7152, 13741, 5966, 9780, 9352, 15570, 7518, 17376, 8404, 16212, 15366, 14328, 10128, 27652, 12939, 21297, 16776, 23422
Offset: 1

Views

Author

Omar E. Pol, Apr 26 2016

Keywords

Examples

			For n = 9 the 9th prime is 23, and the sum of the divisors of 9 is 1 + 3 + 9 = 13, and 23*13 = 299, so a(9) = 299.
On the other hand 9*23 = 207 and the sum of the divisors of 207 is 1 + 3 + 9 + 23 + 69 + 207 = 312 and 312 - 13 = 299, so a(9) = 299.

Crossrefs

Main diagonal of A272214.
Cf. A000040, A000203, A033286, A272173, A272400.

Programs

  • Mathematica
    Table[DivisorSigma[1, n]*Prime[n], {n, 1, 50}] (* G. C. Greubel, Apr 27 2016 *)
  • PARI
    a(n) = prime(n)*sigma(n); \\ Michel Marcus, Apr 27 2016

Formula

a(n) = prime(n)*sigma(n) = A000040(n)*A000203(n).
a(n) = sigma(n*prime(n)) - sigma(n) = A000203(n*A000040(n)) - A000203(n) = A000203(A033286(n)) - A000203(n) = A272173(n) - A000203(n).
Showing 1-3 of 3 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.