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

A258851 The pi-based arithmetic derivative of n: a(p) = pi(p) for p prime, a(u*v) = a(u)*v + u*a(v), where pi = A000720.

Original entry on oeis.org

0, 0, 1, 2, 4, 3, 7, 4, 12, 12, 11, 5, 20, 6, 15, 19, 32, 7, 33, 8, 32, 26, 21, 9, 52, 30, 25, 54, 44, 10, 53, 11, 80, 37, 31, 41, 84, 12, 35, 44, 84, 13, 73, 14, 64, 87, 41, 15, 128, 56, 85, 55, 76, 16, 135, 58, 116, 62, 49, 17, 136, 18, 53, 120, 192, 69, 107
Offset: 0

Views

Author

Alois P. Heinz, Jun 12 2015

Keywords

Comments

The pi-based variant of the arithmetic derivative of n (A003415).

Links

Crossrefs

Column k=1 of A258850, A258997.
First differences give A258863.
Partial sums give A258864.
Cf. A000720 (pi), A003415, A020639, A032742, A055396, A056239, A258861, A258862, A258995, A278510.

Programs

  • Maple
    with(numtheory):
a:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
seq(a(n), n=0..100);
  • Mathematica
    a[n_] := n*Total[Last[#]*PrimePi[First[#]]/First[#]& /@ FactorInteger[n]]; a[0] = 0; Array[a, 100, 0] (* Jean-François Alcover, Apr 24 2016 *)
  • PARI
    A258851(n)=n*sum(i=1, #n=factor(n)~, n[2, i]*primepi(n[1, i])/n[1, i]) \\ M. F. Hasler, Jul 13 2015
  • Scheme
    (define (A258851 n) (if (<= n 1) 0 (+ (* (A055396 n) (A032742 n)) (* (A020639 n) (A258851 (A032742 n)))))) ;; Antti Karttunen, Mar 07 2017

Formula

a(n) = n * Sum e_j*pi(p_j)/p_j for n = Product p_j^e_j with pi = A000720.
a(A258861(n)) = n; A258861 = pi-based antiderivative of n.
a(a(A258862(n))) = n; A258862 = second pi-based antiderivative of n.
a(a(a(A258995(n)))) = n; A258995 = third pi-based antiderivative of n.
a(0) = a(0*p) = a(0)*p + 0*a(p) = a(0)*p for all p => a(0) = 0.
a(p) = a(1*p) = a(1)*p + 1*a(p) = a(1)*p + a(p) for all p => a(1) = 0.
a(u^v) = v * u^(v-1) * a(u).

A259016 A(n,k) = k-th pi-based antiderivative of n; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

0, 0, 1, 0, 2, 2, 0, 3, 3, 3, 0, 5, 5, 5, 4, 0, 11, 11, 11, 4, 5, 0, 10, 10, 10, 4, 11, 6, 0, 29, 29, 29, 4, 10, 13, 7, 0, 78, 78, 78, 4, 29, 41, 6, 8, 0, 141, 141, 141, 4, 78, 35, 13, 19, 9, 0, 266, 266, 266, 4, 141, 38, 41, 15, 23, 10, 0, 147, 147, 147, 4, 266, 163, 35, 14, 83, 29, 11
Offset: 0

Views

Author

Alois P. Heinz, Jun 16 2015

Keywords

Examples

			A(5,3) = 29 -> 10 -> 11 -> 5.
A(5,4) = 78 -> 127 -> 31 -> 11 -> 5.
Square array A(n,k) begins:
  0,  0,  0,   0,    0,     0,     0,      0,     0,      0, ...
  1,  2,  3,   5,   11,    10,    29,     78,   141,    266, ...
  2,  3,  5,  11,   10,    29,    78,    141,   266,    147, ...
  3,  5, 11,  10,   29,    78,   141,    266,   147,    194, ...
  4,  4,  4,   4,    4,     4,     4,      4,     4,      4, ...
  5, 11, 10,  29,   78,   141,   266,    147,   194,   1181, ...
  6, 13, 41,  35,   38,   163,   138,    253,   346,   1383, ...
  7,  6, 13,  41,   35,    38,   163,    138,   253,    346, ...
  8, 19, 15,  14,   43,   191,   201,    217,  1113,   1239, ...
  9, 23, 83, 431, 3001, 27457, 10626, 112087, 87306, 172810, ...

Links

Crossrefs

Columns k=0-3 give: A001477, A258861, A258862, A258995.
Rows n=0,1,4,7,8,9 give: A000004, A258975, A010709, A259168, A259169, A259170.
Cf. A000040, A000720, A258850, A258851.

Programs

  • Maple
    with(numtheory):
d:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
A:= proc() local t, A; t, A:= proc()-1 end, proc()-1 end;
      proc(n, k) local h;
        while A(n, k) = -1 do
          t(k):= t(k)+1; h:= (d@@k)(t(k));
          if A(h, k) = -1 then A(h, k):= t(k) fi
        od; A(n, k)
      end
    end():
seq(seq(A(n, h-n), n=0..h), h=0..12);
  • Mathematica
    d[n_] := If[n == 0, 0, n*Total[Last[#]*PrimePi[First[#]]/First[#]& /@ FactorInteger[n]]];
A[n_, k_] := For[m = 0, True, m++, If[Nest[d, m, k] == n, Return[m]]];
Table[A[n, k-n], {k, 0, 12}, {n, 0, k}] // Flatten (* Jean-François Alcover, Mar 20 2017 *)

Formula

A(n,k) = min { m >= 0 : A258851^k(m) = n }.
A258850(A(n,k),k) = n.
A(n,k) <= A000040^k(n) for n>0.

A258861 The pi-based antiderivative of n: the least m such that A258851(m) equals n.

Original entry on oeis.org

0, 2, 3, 5, 4, 11, 13, 6, 19, 23, 29, 10, 8, 41, 43, 14, 53, 59, 61, 15, 12, 22, 79, 83, 89, 26, 21, 103, 107, 109, 25, 34, 16, 18, 139, 38, 151, 33, 163, 167, 173, 35, 181, 191, 28, 197, 199, 211, 223, 58, 229, 233, 24, 30, 27, 51, 49, 269, 55, 277, 281, 74
Offset: 0

Views

Author

Alois P. Heinz, Jun 12 2015

Keywords

Links

Crossrefs

Column k=1 of A259016, A259153.
Cf. A000040, A000720, A258851, A258862, A258995.

Programs

  • Maple
    with(numtheory):
d:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
a:= proc() local t, a; t, a:= -1, proc() -1 end;
      proc(n) local h;
        while a(n) = -1 do
          t:= t+1; h:= d(t);
          if a(h) = -1 then a(h):= t fi
        od; a(n)
      end
    end():
seq(a(n), n=0..100);
  • Mathematica
    A258851[n_] := If[n == 0, 0, n*Total[Last[#]*PrimePi[First[#]]/First[#]& /@ FactorInteger[n]]];
a[n_] := For[m = 0, True, m++, If[A258851[m] == n, Return[m]]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Sep 10 2023 *)

Formula

a(n) = min { m >= 0 : A258851(m) = n }.
A258851(a(n)) = n.
a(n) <= A000040(n) for n>0.

A258862 Second pi-based antiderivative of n: the least m such that A258851^2(m) equals n.

Original entry on oeis.org

0, 3, 5, 11, 4, 10, 41, 13, 15, 83, 109, 29, 19, 35, 191, 43, 30, 277, 74, 14, 8, 42, 77, 431, 461, 21, 22, 563, 66, 599, 26, 78, 12, 61, 141, 163, 877, 18, 214, 218, 226, 38, 114, 201, 105, 1201, 215, 1297, 302, 55, 1447, 1471, 89, 25, 103, 170, 58, 291, 51
Offset: 0

Views

Author

Alois P. Heinz, Jun 12 2015

Keywords

Links

Crossrefs

Column k=2 of A259016.
Cf. A000040, A000720, A258851, A258852, A258861, A258995.

Programs

  • Maple
    with(numtheory):
d:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
a:= proc() local t, a; t, a:= -1, proc() -1 end;
      proc(n) local h;
        while a(n) = -1 do
          t:= t+1; h:= d(d(t));
          if a(h) = -1 then a(h):= t fi
        od; a(n)
      end
    end():
seq(a(n), n=0..100);
  • Mathematica
    d[n_] := d[n] = If[n == 0, 0, n*Total[Last[#]*PrimePi[First[#]]/First[#]& /@ FactorInteger[n]]];
A[n_, k_] := For[m = 0, True, m++, If[Nest[d, m, k] == n, Return[m]]];
a[n_] := A[n, 2];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, May 17 2024 *)

Formula

a(n) = min { m >= 0 : A258851^2(m) = n }.
A258851^2(a(n)) = A258852(a(n)) = n.
a(n) <= A000040^2(n) for n>0.
a(n) <= A258861^2(n); a(21) = 42 < A258861^2(21) = A258861(22) = 79; A258851^2(42) = A258851^2(79) = 21.

A258853 Third pi-based arithmetic derivative of n.

Original entry on oeis.org

0, 0, 0, 0, 4, 1, 4, 4, 32, 32, 3, 2, 80, 4, 8, 12, 208, 4, 12, 20, 208, 30, 25, 20, 108, 16, 53, 351, 192, 5, 32, 3, 512, 20, 5, 6, 248, 32, 13, 192, 248, 7, 26, 19, 704, 172, 6, 8, 1600, 156, 71, 49, 324, 80, 864, 56, 332, 16, 116, 4, 536, 37, 32, 424, 2432
Offset: 0

Views

Author

Alois P. Heinz, Jun 12 2015

Keywords

Links

Crossrefs

Column k=3 of A258850.
Cf. A000720, A258851, A258995.

Programs

  • Maple
    with(numtheory):
d:= n-> n*add(i[2]*pi(i[1])/i[1], i=ifactors(n)[2]):
A:= proc(n, k) option remember; `if`(k=0, n, d(A(n, k-1))) end:
a:= n-> A(n, 3):
seq(a(n), n=0..100);

Formula

a(n) = A258851^3(n).
a(A258995(n)) = n.
Showing 1-5 of 5 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.