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.

A185651 A(n,k) = Sum_{d|n} phi(d)*k^(n/d); square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 0, 3, 6, 3, 0, 0, 4, 12, 12, 4, 0, 0, 5, 20, 33, 24, 5, 0, 0, 6, 30, 72, 96, 40, 6, 0, 0, 7, 42, 135, 280, 255, 84, 7, 0, 0, 8, 56, 228, 660, 1040, 780, 140, 8, 0, 0, 9, 72, 357, 1344, 3145, 4200, 2205, 288, 9, 0
Offset: 0

Views

Author

Alois P. Heinz, Aug 29 2013

Keywords

Comments

Dirichlet convolution of phi(n) and k^n. - Richard L. Ollerton, May 07 2021

Examples

			Square array A(n,k) begins:
  0, 0,  0,   0,    0,     0,     0, ...
  0, 1,  2,   3,    4,     5,     6, ...
  0, 2,  6,  12,   20,    30,    42, ...
  0, 3, 12,  33,   72,   135,   228, ...
  0, 4, 24,  96,  280,   660,  1344, ...
  0, 5, 40, 255, 1040,  3145,  7800, ...
  0, 6, 84, 780, 4200, 15810, 46956, ...

Links

Crossrefs

Columns k=0..10 give A000004, A001477, A053635, A054610, A054611, A054612, A054613, A054614, A054615, A054616, A054617.
Rows n=0..10 give A000004, A001477, A002378, A054602, A054603, A054604, A054605, A054606, A054607, A054608, A054609.
Main diagonal gives A228640.
Cf. A000010, A075195, A258170.

Programs

  • Maple
    with(numtheory):
A:= (n, k)-> add(phi(d)*k^(n/d), d=divisors(n)):
seq(seq(A(n, d-n), n=0..d), d=0..12);
  • Mathematica
    a[, 0] = a[0, ] = 0; a[n_, k_] := Sum[EulerPhi[d]*k^(n/d), {d, Divisors[n]}]; Table[a[n - k, k], {n, 0, 12}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Dec 06 2013 *)

Formula

A(n,k) = Sum_{d|n} phi(d)*k^(n/d).
A(n,k) = Sum_{i=0..min(n,k)} C(k,i) * i! * A258170(n,i). - Alois P. Heinz, May 22 2015
G.f. for column k: Sum_{n>=1} phi(n)*k*x^n/(1-k*x^n) for k >= 0. - Petros Hadjicostas, Nov 06 2017
From Richard L. Ollerton, May 07 2021: (Start)
A(n,k) = Sum_{i=1..n} k^gcd(n,i).
A(n,k) = Sum_{i=1..n} k^(n/gcd(n,i))*phi(gcd(n,i))/phi(n/gcd(n,i)).
A(n,k) = A075195(n,k)*n for n >= 1, k >= 1. (End)

A129506 Number of partitions of a {2n-1}-set into n nonempty subsets.

Original entry on oeis.org

1, 3, 25, 350, 6951, 179487, 5715424, 216627840, 9528822303, 477297033785, 26826851689001, 1672162773483930, 114485073343744260, 8541149231801585700, 689692892575539953400, 59932861644880019603520, 5576731051262006158950735, 553234633385550257808059085
Offset: 1

Views

Author

Paul D. Hanna, Apr 18 2007

Keywords

Comments

B^{-1}(x) = Sum_{n>0} a(n)/(2*n-1)!*(n-1)! x^n is inverse function for x*B(x), where B(x) is g.f. for Bernoulli number (see A027641). - Vladimir Kruchinin, Jan 19 2012

Examples

			G.f.: A(x) = x + 3*x^2 + 25*x^3 + 350*x^4 + 6951*x^5 + 179487*x^6 + ... where A(x) = 1^1*x*exp(-1^2*x) + 2^3*exp(-2^2*x)*x^2/2! + 3^5*exp(-3^2*x)*x^3/3! + 4^7*exp(-4^2*x)*x^4/4! + 5^9*exp(-5^2*x)*x^5/5! + ... forms a power series in x with integer coefficients. - _Paul D. Hanna_, Oct 15 2012

Links

Crossrefs

Cf. A008277, A129505, A217900, A217910, A217913, A258170.

Programs

  • Maple
    a:= n-> Stirling2(2*n-1, n):
seq(a(n), n=1..25);  # Alois P. Heinz, Dec 15 2013
  • Mathematica
    a[n_] := Sum[ Binomial[2*n - 2, j]*StirlingS2[2*n - j - 2, n-1], {j, 0, n-1}]; Table[a[n], {n, 1, 18}] (* Jean-François Alcover, Jun 14 2013, after Vladimir Kruchinin *)
Table[StirlingS2[2*n-1,n], {n, 1, 20}] (* Vaclav Kotesovec, Dec 15 2013 *)
  • Maxima
    a(n):=((2*n-1)*((sum((stirling2(2*i-1, i)*binomial(2*n-2, 2*i-1)*stirling2(2*(n-i)-1, n-i-1))/((n-i-1)*binomial(n-1, i)), i, 1, n-2))+(n-1)* stirling2(2*n-3, n-1)+stirling2(2*n-2, n-1)))/(n);
  makelist(a(n),n,1,10); /* Vladimir Kruchinin, Feb 28 2013 */
  • PARI
    a(n)=polcoeff(1/prod(k=1,n,1-k*x +x*O(x^n)),n-1)
  • PARI
    vector(66, n, abs( stirling(2*n-1, n, 2) ) ) /* Joerg Arndt, Jun 09 2012 */
  • PARI
    {a(n)=1/n!*sum(k=0,n, (-1)^(n-k)*binomial(n,k)*k^(2*n-1))} \\ Paul D. Hanna, Oct 15 2012
  • PARI
    {a(n)=polcoeff(sum(m=1,n,m^(2*m-1)*x^m*exp(-m^2*x+x*O(x^n))/m!),n)}
for(n=1,20,print1(a(n),", "))

Formula

Central Stirling numbers of the second kind: a(n) = A008277(2n-1,n) for n >= 1.
G.f.: Sum_{n>=1} n^(2*n-1) * exp(-n^2*x) * x^n / n!, an integer series. - Paul D. Hanna, Oct 15 2012
a(n) = 1/n! * Sum_{k=1..n} (-1)^(n-k) * binomial(n,k) * k^(2*n-1). - Paul D. Hanna, Oct 15 2012
a(n) = ((2*n-1)*((sum(i=1..n-2, (stirling2(2*i-1,i)*C(2*n-2,2*i-1)*stirling2(2*(n-i)-1,n-i-1))/((n-i-1)*C(n-1,i))))+(n-1)*stirling2(2*n-3,n-1) +stirling2(2*n-2,n-1)))/n. - Vladimir Kruchinin, Feb 28 2013
a(n-1) = sum(j=0..n, binomial(2*n,j)*stirling2(2*n-j,n)). - Vladimir Kruchinin, Jun 14 2013
a(n) ~ 2^(2*n-3/2) * n^(n-3/2) * (2-c)^(1-n) / (sqrt(Pi*(1-c)) * exp(n) * c^n), where c = -LambertW(-2*exp(-2)) = 0.4063757399599599... = 2*A106533. - Vaclav Kotesovec, Dec 15 2013
a(n) = A258170(2*n-1,n). - Alois P. Heinz, Mar 16 2018

A258171 a(n) = Sum_{d|n} phi(d)*Bell(n/d) for n>0, a(0) = 0.

Original entry on oeis.org

0, 1, 3, 7, 19, 56, 214, 883, 4163, 21163, 116039, 678580, 4213848, 27644449, 190900217, 1382958677, 10480146333, 82864869820, 682076827740, 5832742205075, 51724158351527, 474869816158547, 4506715739125923, 44152005855084368, 445958869299027638
Offset: 0

Views

Author

Alois P. Heinz, May 22 2015

Keywords

Comments

Dirichlet convolution of phi(n) (A000010) and the Bell numbers (A000110) (n >= 1). - Richard L. Ollerton, May 09 2021

Links

Crossrefs

Row sums of A258170.
Similar: A078392 (numbpart), this sequence (bell), A053635 (numbcomb), A181847 and A034738 (numbcomp), A327030 (numbperm).
Cf. A000010, A000110.

Programs

  • Maple
    with(numtheory):
A:= proc(n, k) option remember;
      add(phi(d)*k^(n/d), d=divisors(n))
    end:
T:= (n, k)-> add((-1)^(k-i)*binomial(k, i)*A(n, i), i=0..k)/k!:
a:= n-> add(T(n, k), k=0..n):
seq(a(n), n=0..30);
  • Mathematica
    a[n_] := If[n == 0, 0, DivisorSum[n, EulerPhi[#] BellB[n/#] &]];
Table[a[n], {n, 0, 25}] (* Peter Luschny, Aug 27 2019 *)

Formula

a(n) = Sum_{k=0..n} A258170(n,k).
For n >= 1, a(n) = Sum_{k=1..n} Bell(gcd(n,k)). - Richard L. Ollerton, May 09 2021

Extensions

New name from Peter Luschny, Aug 27 2019
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.