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.

A109932 a(n) = f^n(n) = f applied n times to n, where f(n) = A007425(n).

This page as a plain text file.
%I A109932 #22 Mar 04 2018 03:11:03
%S A109932 1,3,3,9,3,6,3,9,6,6,3,18,3,6,9,9,3,18,3,18,9,6,3,9,6,6,6,18,3,6,3,9,
%T A109932 9,6,9,36,3,6,9,9,3,6,3,18,18,6,3,18,6,18,9,18,3,9,9,9,9,6,3,6,3,6,18,
%U A109932 18,9,6,3,18,9,6,3,9,3,6,18,18,9,6,3,18,6,6,3,6,9,6,9,9,3,6,9,18,9,6,9,18
%N A109932 a(n) = f^n(n) = f applied n times to n, where f(n) = A007425(n).
%D A109932 Amarnath Murthy and Mihaly Bencze [Beneze], Extending the scope of some number theoretic functions, Octogon Mathematical Magazine, 2003, Brasov, Romania.
%H A109932 Antti Karttunen, <a href="/A109932/b109932.txt">Table of n, a(n) for n = 1..10000</a>
%t A109932 f[n_] := Plus @@ DivisorSigma[0, Divisors[n]]; Table[ Nest[f, n, n], {n, 96}] (* _Robert G. Wilson v_ *)
%o A109932 (PARI)
%o A109932 A007425(n) = sumdivmult(n, k, numdiv(k)); \\ _Charles R Greathouse IV_, Aug 30 2013
%o A109932 A109932(n) = { my(k=n); while(n, n--; k = A007425(k)); k; }; \\ _Antti Karttunen_, Sep 22 2017
%Y A109932 Cf. A007425.
%K A109932 nonn
%O A109932 1,2
%A A109932 _Amarnath Murthy_, Jul 18 2005
%E A109932 More terms from _Robert G. Wilson v_, Jul 21 2005
%E A109932 Name edited by _Antti Karttunen_, Sep 22 2017