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.

A130211 Triangle read by rows: matrix product A054522 * A000012.

Original entry on oeis.org

1, 2, 1, 3, 2, 2, 4, 3, 2, 2, 5, 4, 4, 4, 4, 6, 5, 4, 2, 2, 2, 7, 6, 6, 6, 6, 6, 6, 8, 7, 6, 6, 4, 4, 4, 4, 9, 8, 8, 6, 6, 6, 6, 6, 6, 10, 9, 8, 8, 8, 4, 4, 4, 4, 4, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 12, 11, 10, 8, 6, 6, 4, 4, 4, 4, 4, 4, 13, 12, 12, 12, 12, 12, 12, 12, 12
Offset: 1

Views

Author

Gary W. Adamson, May 17 2007

Keywords

Examples

			First few rows of the triangle are:
1;
2, 1;
3, 2, 2;
4, 3, 2, 2;
5, 4, 4, 4, 4;
6, 5, 4, 2, 2, 2;
7, 6, 6, 6, 6, 6, 6;
8, 7, 6, 6, 4, 4, 4, 4;
...
		

Crossrefs

Cf. A000010, A054522, A130212 (product with swapped order), A057660 (row sums).

Programs

Formula

A054522 * A000012 as infinite lower triangular matrices.
T(n,n) = A000010(n).

A181550 T(n,k) = floor(n/k)*A181549(k), triangle read by rows.

Original entry on oeis.org

1, 2, 3, 3, 3, 4, 4, 6, 4, 5, 5, 6, 4, 5, 6, 6, 9, 8, 5, 6, 12, 7, 9, 8, 5, 6, 12, 8, 8, 12, 8, 10, 6, 12, 8, 10, 9, 12, 12, 10, 6, 12, 8, 10, 11, 10, 15, 12, 10, 12, 12, 8, 10, 11, 18, 11, 15, 12, 10, 12, 12, 8, 10, 11, 18, 12, 12, 18, 16, 15, 12, 24, 8, 10, 11, 18, 12, 20
Offset: 1

Views

Author

Peter Luschny, Oct 30 2010

Keywords

Comments

A181549(n) = sum{k|n} k mu_2(n/k), a variant of Euler's phi function relative to the Moebius function of order 2.

Examples

			1
2, 3
3, 3, 4
4, 6, 4, 5
5, 6, 4, 5, 6
6, 9, 8, 5, 6, 12
7, 9, 8, 5, 6, 12, 8
8, 12, 8, 10, 6, 12, 8, 10
		

Crossrefs

Programs

  • Maple
    A181550 := (n,k) -> iquo(n,k)*A181549(k);
  • Mathematica
    mu2[1] = 1; mu2[n_] := Sum[Boole[Divisible[n, d^2]]*MoebiusMu[n/d^2]*MoebiusMu[n/d], {d, Divisors[n]}]; A181549[n_] := Sum[k*mu2[n/k], {k, Divisors[n]}]; t[n_, k_] := Floor[n/k]*A181549[k]; Table[t[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* Jean-François Alcover, Feb 05 2014 *)

A181552 T(n,k) = gcd(n,k) A181549(k), triangle read by rows.

Original entry on oeis.org

1, 1, 6, 1, 3, 12, 1, 6, 4, 20, 1, 3, 4, 5, 30, 1, 6, 12, 10, 6, 72, 1, 3, 4, 5, 6, 12, 56, 1, 6, 4, 20, 6, 24, 8, 80, 1, 3, 12, 5, 6, 36, 8, 10, 99, 1, 6, 4, 10, 30, 24, 8, 20, 11, 180, 1, 3, 4, 5, 6, 12, 8, 10, 11, 18, 132, 1, 6, 12, 20, 6, 72, 8, 40, 33, 36, 12, 240
Offset: 1

Views

Author

Peter Luschny, Oct 30 2010

Keywords

Comments

A181549(n) = sum{k|n} k mu_2(n/k) is a variant of Euler's phi function relative to the Moebius function of order 2.

Examples

			1,
1,6,
1,3,12,
1,6,.4,20,
1,3,.4,.5,30,
1,6,12,10,.6,72,
1,3,.4,.5,.6,12,56,
1,6,.4,20,.6,24,.8,80,
		

Crossrefs

Cf. A130212, A181538, row sums of triangle is A181553.

Programs

  • Maple
    A181552 := (n,k) -> igcd(n,k)*A181549(k);
  • Mathematica
    mu2[1] = 1; mu2[n_] := Sum[Boole[Divisible[n, d^2]]*MoebiusMu[n/d^2]*MoebiusMu[n/d], {d, Divisors[n]}]; A181549[n_] := Sum[k*mu2[n/k], {k, Divisors[n]}]; t[n_, k_] := GCD[n, k]*A181549[k]; Table[t[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* Jean-François Alcover, Feb 05 2014 *)
Showing 1-3 of 3 results.