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.

A351442 a(n) = A003958(sigma(n)), where A003958 is multiplicative with a(p^e) = (p-1)^e and sigma is the sum of divisors function.

Original entry on oeis.org

1, 2, 1, 6, 2, 2, 1, 8, 12, 4, 2, 6, 6, 2, 2, 30, 4, 24, 4, 12, 1, 4, 2, 8, 30, 12, 4, 6, 8, 4, 1, 24, 2, 8, 2, 72, 18, 8, 6, 16, 12, 2, 10, 12, 24, 4, 2, 30, 36, 60, 4, 36, 8, 8, 4, 8, 4, 16, 8, 12, 30, 2, 12, 126, 12, 4, 16, 24, 2, 4, 4, 96, 36, 36, 30, 24, 2, 12, 4, 60, 100, 24, 12, 6, 8, 20, 8
Offset: 1

Views

Author

Antti Karttunen, Feb 12 2022

Keywords

Comments

Question: Are there more fixed points than 1, 2, 8, 128, 288, 720, 32768, 29719872, ..., 2147483648 ?

Links

Crossrefs

Cf. A000203, A003958, A322582, A339905, A351443, A351444, A351445, A351446, A351447, A351448, A351456.
Cf. also A348512.

Programs

  • PARI
    A003958(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]--); factorback(f); };
A351442(n) = A003958(sigma(n));

Formula

Multiplicative with a(p^e) = A003958(1 + p + ... + p^e).
a(n) = A003958(A000203(n)).
a(n) = A351444(n) - A322582(n) = A351445(n) + A003958(n).

A351446 Numbers k for which A003958(sigma(k)) = A003958(k), where A003958 is multiplicative with a(p^e) = (p-1)^e and sigma is the sum of divisors function.

Original entry on oeis.org

1, 6, 10, 26, 28, 49, 54, 74, 122, 126, 146, 294, 314, 386, 408, 490, 496, 554, 626, 680, 794, 842, 914, 1082, 1226, 1232, 1274, 1322, 1346, 1466, 1514, 1560, 1754, 1768, 1994, 2186, 2306, 2402, 2426, 2474, 2642, 2646, 2762, 2906, 3242, 3314, 3360, 3506, 3626, 3672, 3746, 3808, 3866, 3986, 4034
Offset: 1

Views

Author

Antti Karttunen, Feb 12 2022

Keywords

Comments

Numbers k for which A351442(k) = A003958(k), or equally, for which k = A351444(k) = A322582(k) + A351442(k).

Links

Crossrefs

Cf. A000203, A003958, A322582, A351442, A351447.
Fixed points of A351444, positions of zeros in A351445.
Subsequences: A000396, A351443 (odd terms), A351440, A336702 (numbers k for which A064989(sigma(k)) = A064989(k)).

Programs

A351445 a(n) = A003958(sigma(n)) - A003958(n), where A003958 is multiplicative with a(p^e) = (p-1)^e and sigma is the sum of divisors function.

Original entry on oeis.org

0, 1, -1, 5, -2, 0, -5, 7, 8, 0, -8, 4, -6, -4, -6, 29, -12, 20, -14, 8, -11, -6, -20, 6, 14, 0, -4, 0, -20, -4, -29, 23, -18, -8, -22, 68, -18, -10, -18, 12, -28, -10, -32, 2, 8, -18, -44, 28, 0, 44, -28, 24, -44, 0, -36, 2, -32, -12, -50, 4, -30, -28, -12, 125, -36, -16, -50, 8, -42, -20, -66, 92, -36, 0
Offset: 1

Views

Author

Antti Karttunen, Feb 12 2022

Keywords

Links

Crossrefs

Cf. A000203, A003958, A351442, A351444, A351457 [= a(A003961(n))].
Cf. A351446 (positions of zeros), A351443 (odd terms there).
Cf. also A348736.

Programs

Formula

a(n) = A351442(n) - A003958(n) = A351444(n) - n.

A351443 Odd numbers k for which A003958(sigma(k)) = A003958(k), where A003958 is multiplicative with a(p^e) = (p-1)^e and sigma is the sum of divisors function.

Original entry on oeis.org

1, 49, 40905, 106353, 140211, 275301, 302697, 499041, 597213, 1094913, 1284417, 1578933, 2004345, 2266137, 2560653, 3247857, 3444201, 3738717, 4425921, 5014953, 5123817, 5211297, 5407641, 5505813, 5996673, 6193017, 6870339, 7174737, 8156457, 8941833, 9432693, 9825381, 9923553
Offset: 1

Views

Author

Antti Karttunen, Feb 12 2022

Keywords

Comments

Odd numbers k for which A351442(k) = A003958(k), or equally, for which k = A351444(k) = A322582(k) + A351442(k).
The 13th term, 2004345, is one of the rare abundant numbers (A005101, A005231) in this sequence.

Links

Crossrefs

Odd terms in A351446.
Cf. A000203, A003958, A005101, A005231, A322582, A351442, A351444, A351445.
These terms doubled form a subsequence of A351447.

Programs

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.