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

A048674 Fixed points of A048673 and A064216: Numbers n such that if n = product_{k >= 1} (p_k)^(c_k), then Product_{k >= 1} (p_{k+1})^(c_k) = (2*n)-1, where p_k indicates the k-th prime, A000040(k).

Original entry on oeis.org

1, 2, 3, 25, 26, 33, 93, 1034, 970225, 8550146, 325422273, 414690595, 1864797542, 2438037206
Offset: 1

Views

Author

Antti Karttunen, Jul 14 1999

Keywords

Comments

Equally: after 1, numbers n such that, if the prime factorization of 2n-1 = Product_{k >= 1} (p_k)^(c_k) then Product_{k >= 1} (p_{k-1})^(c_k) = n.
Factorization of the initial terms: 1, 2, 3, 5^2, 2*13, 3*11, 3*31, 2*11*47, 5^2*197^2, 2*11*47*8269, 3*11*797*12373, 5*11^2*433*1583, 2*23*59*101*6803, 2*11*53*1201*1741.
The only 3-cycle of permutation A048673 in range 1 .. 402653184 is (2821 3460 5639).
For 2-cycles, take setwise difference of A245449 and this sequence.
Numbers k for which A336853(k) = k-1. - Antti Karttunen, Nov 26 2021

Examples

			25 is present, as 2*25 - 1 = 49 = p_4^2, and p_3^2 = 5*5 = 25.
26 is present, as 2*26 - 1 = 51 = 3*17 = p_2 * p_8, and p_1 * p_7 = 2*13 = 26.
Alternatively, as 26 = 2*13 = p_1 * p_7, and ((p_2 * p_8)+1)/2 = ((3*17)+1)/2 = 26 also, thus 26 is present.

Crossrefs

Fixed points of permutation pair A048673/A064216.
Positions of zeros in A349573.
Subsequence of the following sequences: A245449, A269860, A319630, A349622, A378980 (see also A379216).
This sequence is also obtained as a setwise difference of the following pairs of sequences: A246281 \ A246351, A246352 \ A246282, A246361 \ A246371, A246372 \ A246362.
Cf. A000040, A003961 (A045965), A064989, A285701, A336853.
Cf. also A348514 (fixed points of map A108228, similar to A048673).

Programs

  • Maple
    A048673 := n -> (A003961(n)+1)/2;
A048674list := proc(upto_n) local b,i; b := [ ]; for i from 1 to upto_n do if(A048673(i) = i) then b := [ op(b), i ]; fi; od: RETURN(b); end;
  • Mathematica
    Join[{1}, Reap[For[n = 1, n < 10^7, n++, ff = FactorInteger[n]; If[Times @@ Power @@@ (NextPrime[ff[[All, 1]]]^ff[[All, 2]]) == 2 n - 1, Print[n]; Sow[n]]]][[2, 1]]] (* Jean-François Alcover, Mar 04 2016 *)
  • PARI
    A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA048674(n) = ((n+n)==(1+A003961(n))); \\ Antti Karttunen, Nov 26 2021

Extensions

Entry revised and the names in Maple-code cleaned by Antti Karttunen, Aug 25 2014
Terms a(11) - a(14) added by Antti Karttunen, Sep 11-13 2014

A349624 Dirichlet convolution of A326042 with A055615 (Dirichlet inverse of n), where A326042(n) = A064989(sigma(A003961(n))).

Original entry on oeis.org

1, -1, -1, 9, -4, 1, -5, -19, 23, 4, -6, -9, -9, 5, 4, 43, -14, -23, -17, -36, 5, 6, -17, 19, 29, 9, -65, -45, -28, -4, -14, -43, 6, 14, 20, 207, -27, 17, 9, 76, -34, -5, -41, -54, -92, 17, -39, -43, 71, -29, 14, -81, -47, 65, 24, 95, 17, 28, -30, 36, -48, 14, -115, 981, 36, -6, -63, -126, 17, -20, -40, -437, -70, 27
Offset: 1

Views

Author

Antti Karttunen, Nov 26 2021

Keywords

Comments

Multiplicative because A055615 and A326042 are.

Links

Crossrefs

Cf. A000203, A003961, A055615, A064989, A326042, A349625 (Dirichlet inverse), A349626.
Cf. also A348736, A349573.

Programs

  • Mathematica
    f1[p_, e_] := NextPrime[p]^e; s1[1] = 1; s1[n_] := Times @@ f1 @@@ FactorInteger[n]; f2[2, e_] := 1; f2[p_, e_] := NextPrime[p, -1]^e; s2[1] = 1; s2[n_] := Times @@ f2 @@@ FactorInteger[n]; s[n_] := s2[DivisorSigma[1, s1[n]]]; a[n_] := DivisorSum[n, # * MoebiusMu[#] * s[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 27 2021 *)
  • PARI
    A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A055615(n) = (n*moebius(n));
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
A326042(n) = A064989(sigma(A003961(n)));
A349624(n) = sumdiv(n,d,A055615(n/d)*A326042(d));

Formula

a(n) = Sum_{d|n} A055615(d) * A326042(n/d).
For all n >= 1, Sum_{d|n, dA326042(n) - n = -A348736(n).

A378747 a(n) = A048673(n) - A001065(n).

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 5, 7, 9, 3, 6, 7, 8, 7, 9, 26, 9, 17, 11, 10, 17, 6, 14, 32, 19, 10, 50, 22, 15, 11, 18, 91, 18, 9, 26, 58, 20, 13, 26, 45, 21, 29, 23, 19, 55, 18, 26, 127, 53, 31, 27, 31, 29, 122, 29, 85, 35, 15, 30, 50, 33, 22, 97, 302, 41, 20, 35, 28, 46, 42, 36, 215, 39, 22, 74, 40, 53, 38, 41, 178, 273, 21
Offset: 1

Views

Author

Antti Karttunen, Dec 09 2024

Keywords

Links

Crossrefs

Cf. A000203, A001065, A003961, A048673, A337378 (where a(n) > n), A337379 (where a(n) <= n), A378748 (Möbius transform), A378749 (Dirichlet inverse).
Cf. also A286385, A349573.

Programs

  • PARI
    A048673(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (factorback(f)+1)/2; };
A378747(n) = (A048673(n)-(sigma(n)-n));

Formula

a(n) = n + (A003961(n)+1)/2 - A000203(n).

A349571 Dirichlet convolution of A048673 with A055615 (Dirichlet inverse of n).

Original entry on oeis.org

1, 0, 0, 1, -1, 2, -1, 4, 4, 3, -4, 4, -4, 5, 6, 13, -7, 6, -7, 5, 10, 6, -8, 10, 5, 8, 24, 9, -13, -2, -12, 40, 12, 9, 16, 16, -16, 11, 16, 11, -19, -2, -19, 8, 14, 14, -20, 28, 19, 9, 18, 12, -23, 26, 22, 21, 22, 15, -28, 2, -27, 18, 26, 121, 28, -8, -31, 11, 28, -8, -34, 46, -33, 20, 18, 15, 34, -8, -37, 29, 124
Offset: 1

Views

Author

Antti Karttunen, Nov 23 2021

Keywords

Comments

Also Dirichlet convolution of A349385 with A349387.

Links

Crossrefs

Cf. A048673, A055615, A349385, A349387, A349572 (Dirichlet inverse).
Cf. also A349398, A349573.

Programs

  • Mathematica
    f[p_, e_] := NextPrime[p]^e; s[1] = 1; s[n_] := (1 + Times @@ f @@@ FactorInteger[n])/2; a[n_] := DivisorSum[n, # * MoebiusMu[#] * s[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 23 2021 *)
  • PARI
    A048673(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (1/2)*(1+factorback(f)); };
A055615(n) = (n*moebius(n));
A349571(n) = sumdiv(n,d,A048673(n/d)*A055615(d));

Formula

a(n) = Sum_{d|n} A048673(n/d) * A055615(d).
a(n) = Sum_{d|n} A349385(n/d) * A349387(d).
Showing 1-4 of 4 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.