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

A163105 a(n) = tau(sigma(tau(n))), where tau = number of divisors of n (A000005), and sigma = sum of divisors of n (A000203).

Original entry on oeis.org

1, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 6, 2, 2, 2, 4, 2, 6, 2, 6, 2, 2, 2, 4, 3, 2, 2, 6, 2, 4, 2, 6, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 6, 6, 2, 2, 6, 3, 6, 2, 6, 2, 4, 2, 4, 2, 2, 2, 6, 2, 2, 6, 4, 2, 4, 2, 6, 2, 4, 2, 6, 2, 2, 6, 6, 2, 4, 2, 6, 4, 2, 2, 6, 2, 2, 2, 4, 2, 6, 2, 6, 2, 2, 2, 6, 2, 6, 6, 2, 2, 4, 2, 4, 4
Offset: 1

Views

Author

Jaroslav Krizek, Jul 20 2009

Keywords

Comments

Repeated application of tau (number of divisors) and sigma (sum of divisors).

Crossrefs

Programs

  • Maple
    with(numtheory) : A163105 := proc(n) tau(sigma(tau(n))) ; end: seq(A163105(n),n=1..120) ; # R. J. Mathar, Jul 27 2009
  • Mathematica
    With[{s = DivisorSigma}, s[0, s[1, s[0, Range[100]]]]] (* Paolo Xausa, Oct 07 2024 *)
  • PARI
    A163105(n) = numdiv(sigma(numdiv(n))); \\ Antti Karttunen, Jul 23 2017

Formula

Extensions

More terms from R. J. Mathar, Jul 27 2009
Name edited by Antti Karttunen, Jul 23 2017
Showing 1-1 of 1 results.