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

A351226 Numbers k for which A276086(k) < k, where A276086 is the primorial base exp-function.

Original entry on oeis.org

6, 30, 31, 32, 36, 60, 210, 211, 212, 213, 214, 215, 216, 217, 218, 240, 241, 242, 420, 421, 422, 2310, 2311, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2328, 2340, 2341, 2342, 2343, 2344, 2345, 2346, 2347, 2348, 2352, 2370, 2371, 2372, 2520, 2521, 2522, 2523, 2524, 2526, 2527
Offset: 1

Views

Author

Antti Karttunen, Feb 05 2022

Keywords

Crossrefs

Cf. A002110 (subsequence from its third term 6 onward), A276086, A351227 (complement).
Positions of negative terms in A351225, positions of zeros in A351089.

Programs

  • Mathematica
    Select[Range[2528], Block[{i, m, n = #, p}, m = i = 1; While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; m < #] &] (* Michael De Vlieger, Feb 05 2022 *)
  • PARI
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    isA351226(n) = (A276086(n)
    				

A351227 Numbers k for which A276086(k) > k, where A276086 is the primorial base exp-function.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87
Offset: 1

Views

Author

Antti Karttunen, Feb 05 2022

Keywords

Crossrefs

Cf. A276086, A351226 (complement), A351229 (subsequence).
Indices of positive terms in A351225.

Programs

  • Mathematica
    Select[Range[0, 87], Block[{i, m, n = #, p}, m = i = 1; While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; m > #] &] (* Michael De Vlieger, Feb 05 2022 *)
  • PARI
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    isA351227(n) = (A276086(n)>n);
Showing 1-2 of 2 results.