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.

A084114 Number of divisions when calculating A084110(n).

This page as a plain text file.
%I A084114 #6 Jul 31 2014 17:26:35
%S A084114 0,0,0,0,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,1,1,1,0,2,0,1,1,1,0,2,0,1,1,1,
%T A084114 1,2,0,1,1,2,0,2,0,1,1,1,0,3,0,1,1,1,0,2,1,2,1,1,0,4,0,1,1,2,1,2,0,1,
%U A084114 1,2,0,4,0,1,1,1,1,2,0,3,1,1,0,4,1,1,1,2,0,4,1,1,1,1,1,4,0,1,1,2,0,2,0,2,2
%N A084114 Number of divisions when calculating A084110(n).
%C A084114 a(n) = A000005(n) - 1 - A084113(n) = A032741(n) - A084113(n) = (A032741(n)-A084115(n))/2;
%C A084114 a(n) = 0 iff n is prime or a square of prime (A000430).
%H A084114 Reinhard Zumkeller, <a href="/A084114/b084114.txt">Table of n, a(n) for n = 1..10000</a>
%o A084114 (Haskell)
%o A084114 a084114 = g 0 1 . tail . a027750_row where
%o A084114    g c _ []     = c
%o A084114    g c x (d:ds) = if r > 0 then g c (x * d) ds else g (c + 1) x' ds
%o A084114                   where (x', r) = divMod x d
%o A084114 -- _Reinhard Zumkeller_, Jul 31 2014
%Y A084114 Cf. A080257.
%Y A084114 Cf. A027750, A084110, A084113.
%K A084114 nonn
%O A084114 1,24
%A A084114 _Reinhard Zumkeller_, May 12 2003