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.

A116550 The bi-unitary analog of Euler's totient function of n.

Original entry on oeis.org

1, 1, 2, 3, 4, 3, 6, 7, 8, 6, 10, 8, 12, 9, 9, 15, 16, 12, 18, 14, 14, 15, 22, 17, 24, 18, 26, 21, 28, 15, 30, 31, 23, 24, 25, 29, 36, 27, 28, 31, 40, 21, 42, 35, 34, 33, 46, 36, 48, 36, 37, 42, 52, 39, 42, 46, 42, 42, 58, 34, 60, 45, 51, 63, 50, 35, 66, 56, 51, 38, 70, 62, 72, 54
Offset: 1

Views

Author

Leroy Quet, Mar 16 2006

Keywords

Comments

a(1)=1; for n>1, a(n) is the number of numbers mA225174(m,n)=1. - N. J. A. Sloane, May 01 2013

Examples

			12 = 2^2 * 3^1. Of the positive integers < 12, there are 8 integers where no prime divides these integers the same number of times the prime divides 12: 1, 2 = 2^1, 5 = 5^1, 7 = 7^1, 8 = 2^3, 9 = 3^2, 10 = 2^1 *5^1 and 11 = 11^1. So a(12) = 8. The other positive integers < 12 (3 = 3^1, 4 = 2^2 and 6 = 2^1 * 3^1) each are divisible by at least one prime the same number of times this prime divides 12.

References

  • M. Lal, H. Wareham and R. Mifflin, Iterates of the bi-unitary totient function, Utilitas Math., 10 (1976), 347-350.

Links

Crossrefs

Cf. A225174, A005424, A225175, A225176, A000010, A047994.

Programs

  • Maple
    # returns the greatest common unitary divisor of m and n, A225174(m,n)
f:=proc(m,n)
   local i,ans;
   ans:=1;
   for i from 1 to min(m,n) do
     if ((m mod i) = 0) and (igcd(i,m/i) = 1)  then
       if ((n mod i) = 0) and (igcd(i,n/i) = 1)  then ans:=i; fi;
     fi;
   od;
ans; end;
A116550:=proc(n)
  global f; local ct,m;
  ct:=0;
  if n = 1 then RETURN(1) else
  for m from 1 to n-1 do
    if f(m,n)=1 then ct:=ct+1; fi;
  od:
  fi;
  ct;
end; # N. J. A. Sloane, May 01 2013
A116550 := proc(n)
    local a,k;
    a := 0 ;
    for k from 1 to n do
        if A165430(k,n) = 1 then
            a := a+1 ;
        end if ;
    end do:
    a ;
end proc: # R. J. Mathar, Jul 21 2016
  • Mathematica
    a[1] = 1; a[n_] := With[{pp = Power @@@ FactorInteger[n]}, Count[Range[n], m_ /; Intersection[pp, Power @@@ FactorInteger[m]] == {}]]; Table[a[n], {n, 1, 90}] (* Jean-François Alcover, Sep 05 2013 *)
phi[x_, n_] := DivisorSum[n, MoebiusMu[#]*Floor[x/#] &]; a[n_] := DivisorSum[n, (-1)^PrimeNu[#]*phi[n/#, #] &, CoprimeQ[#, n/#] &]; Array[a, 100] (* Amiram Eldar, Jul 16 2022 *)
  • PARI
    udivs(n) = {my(d = divisors(n)); select(x->(gcd(x, n/x)==1), d); }
gcud(n, m) = vecmax(setintersect(udivs(n), udivs(m)));
a(n) = if (n==1, 1, sum(k=1, n-1, gcud(n, k) == 1)); \\ Michel Marcus, Nov 09 2017
  • PARI
    phi(x,n) = sumdiv(n, d, moebius(d)*floor(x/d));
a(n) = sumdiv(n, d, (gcd(d, n/d) == 1) * (-1)^omega(d) * phi(n/d,d)); \\ Amiram Eldar, Jul 16 2022

Formula

For n>1, if n = product{p=primes,p|n} p^b(n,p), where each b(n,p) is a positive integer, then a(n) is number of positive integers m, m < n, such that each b(m,p) does not equal b(n,p).
a(n) = Sum_{d|n, gcd(d,n/d)=1} (-1)^omega(d) * phi(x, n), where phi(x, n) = #{1 <= k <= x, gcd(k, n) = 1} = Sum_{d|n} mu(d) * floor(x/d) (Tóth, 2009). - Amiram Eldar, Jul 16 2022

Extensions

More terms from R. J. Mathar, Jan 23 2008
Entry revised by N. J. A. Sloane, May 01 2013

A005424 Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.

Original entry on oeis.org

2, 3, 4, 5, 8, 9, 13, 16, 17, 24, 25, 35, 44, 63, 64, 91, 97, 128, 193, 221, 259, 324, 353, 391, 477, 702, 929, 1188, 1269, 1589, 1613, 2017, 2309, 2623, 3397, 4064, 4781, 5468, 6515, 6887, 9213, 12286, 12887, 14009, 16564, 16897, 17803, 30428, 36256
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

Let p(n) = number of unitary divisors k of n, k

References

  • M. Lal, H. Wareham and R. Mifflin, Iterates of the bi-unitary totient function, Utilitas Math., 10 (1976), 347-350.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A116550, A225175, A225176.

Programs

  • Maple
    L := [seq(0,i=0..100)] ;
for n from 1 do
    itr := A225320(n) ;
    if itr < nops(L) then
        if op(itr,L) = 0 then
            L := subsop(itr=n,L) ;
            print(L) ;
        end if;
    end if;
end do: # R. J. Mathar, May 02 2013
  • Mathematica
    A116550[1] = 1; A116550[n_] := With[{pp = Power @@@ FactorInteger[n]}, Count[Range[n], m_ /; Intersection[pp, Power @@@ FactorInteger[m]] == {}]]; A225320[n_] := A225320[n] = If[n == 1, 0, 1+A225320[A116550[n]]]; L = Array[0&, 100]; For[n = 1, n <= 40000, n++, itr = A225320[n]; If[itr < Length[L], If[L[[itr]] == 0, L = ReplacePart[L, itr -> n]; Print[Select[L, Positive] // Last]]]]; Select[L, Positive] (* Jean-François Alcover, Jan 13 2014, after R. J. Mathar *)

A225175 Largest number which requires n iterations of the bi-unitary totient function (A116550) to reach 1.

Original entry on oeis.org

1, 2, 3, 6, 10, 11, 12, 18, 30, 42, 78, 106, 210, 366, 550, 603, 750, 1290, 2562, 4398, 4305, 7470, 9090, 14322, 24558, 35382, 55482, 78020, 141190, 207519, 301642, 429870, 552693, 684846, 1060710, 1391390, 2385246, 3454044
Offset: 0

Views

Author

N. J. A. Sloane, May 01 2013

Keywords

Comments

a(26) >= 55482. a(27) >= 78020. - R. J. Mathar, May 05 2013

References

  • M. Lal, H. Wareham and R. Mifflin, Iterates of the bi-unitary totient function, Utilitas Math., 10 (1976), 347-350.

Crossrefs

Cf. A116550, A005424, A225176, A225174, A047994, A003271, A225172, A225173.

Extensions

a(26)-a(37) from Donovan Johnson, Dec 07 2013
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.