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.

A377019 Numbers whose prime factorization has exponents that are all factorial numbers.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78
Offset: 1

Views

Author

Amiram Eldar, Oct 13 2024

Keywords

Comments

First differs from its subsequence A004709 and from A344742 at n = 55: a(55) = 64 = 2^6 is not a term of A004709 and A344742.
Numbers k such that A376885(k) = A001221(k).
The asymptotic density of this sequence is Product_{p prime} (1 - 1/p^3 + (1 - 1/p) * (Sum_{k>=3} 1/p^(k!))) = 0.84018238588352905855... .

Crossrefs

Subsequence of A377020.
Subsequences: A005117, A004709.

Programs

  • Mathematica
    factorialQ[n_] := factorialQ[n] = Module[{m = n, k = 2}, While[Divisible[m, k], m /= k; k++]; m == 1]; q[n_] := AllTrue[FactorInteger[n][[;;, 2]], factorialQ]; Select[Range[100], q]
  • PARI
    isf(n) = {my(k = 2); while(!(n % k), n /= k; k++); n == 1;}
    is(k) = {my(e = factor(k)[, 2]); for(i = 1, #e, if(!isf(e[i]), return(0))); 1;}

A377020 Numbers whose prime factorization has exponents that are all numbers of the form m*k!, where 1 <= m <= k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76
Offset: 1

Views

Author

Amiram Eldar, Oct 13 2024

Keywords

Comments

First differs from A138302 and A270428 at n = 57: a(57) = 64 is not a term of A138302 and A270428.
First differs from A337052 at n = 193: A337052(193) = 216 is not a term of this sequence.
First differs from A335275 at n = 227: A335275(227) = 256 is not a term of this sequence.
First differs from A220218 at n = 903: A220218(903) = 1024 is not a term of this sequence.
Numbers k such that A376886(k) = A001221(k).
The asymptotic density of this sequence is Product_{p prime} (1 - 1/p^3 + (1 - 1/p) * (Sum_{k>=3} 1/p^A051683(k))) = 0.87902453718626485582... .
a(n) = A096432(n-1) for 2<=n<380, but then the sequences start to differ: A096432 contains 432, 648, 1024, 1728, 2000, 2160,... which are not in this sequence. - R. J. Mathar, Oct 15 2024

Crossrefs

Programs

  • Mathematica
    expQ[n_] := expQ[n] = Module[{m = n, k = 2}, While[Divisible[m, k], m /= k; k++]; m < k]; q[n_] := AllTrue[FactorInteger[n][[;;, 2]], expQ]; Select[Range[100], q]
  • PARI
    isf(n) = {my(k = 2); while(!(n % k), n /= k; k++); n < k;}
    is(k) = {my(e = factor(k)[, 2]); for(i = 1, #e, if(!isf(e[i]), return(0))); 1;}

A377022 Numbers whose prime factorization has exponents that have no digit 1 in their factorial-base representation (A255411).

Original entry on oeis.org

1, 16, 81, 625, 1296, 2401, 4096, 10000, 14641, 28561, 38416, 50625, 65536, 83521, 130321, 194481, 234256, 262144, 279841, 331776, 456976, 531441, 707281, 810000, 923521, 1185921, 1336336, 1500625, 1874161, 2085136, 2313441, 2560000, 2825761, 3111696, 3418801
Offset: 1

Views

Author

Amiram Eldar, Oct 13 2024

Keywords

Comments

Numbers that are "powerful" when they are factorized into factors of the form p^(k!), where p is a prime and k >= 1, a factorization that is done using the factorial-base representation of the exponents in the prime factorization (see A376885 for more details). Each factor p^(k!) has a multiplicity that is larger than 1.

Crossrefs

Analogous to A001694.
Subsequence of A036967.

Programs

  • Mathematica
    expQ[n_] := expQ[n] = Module[{k = n, m = 2, r, s = 1}, While[{k, r} = QuotientRemainder[k, m]; k != 0 || r != 0, If[r == 1, s = 0; Break[]]; m++]; s == 1]; seq[lim_] := Module[{p = 2, s = {1}, emax, es}, While[(emax = Floor[Log[p, lim]]) > 3, es = Select[Range[0, emax], expQ]; s = Union[s, Select[Union[Flatten[Outer[Times, s, p^es]]], # <= lim &]]; p = NextPrime[p]]; s]; seq[4*10^6]
  • PARI
    isexp(n) = {my(k = n, m = 2, r); while([k, r] = divrem(k, m); k != 0 || r != 0, if(r == 1, return(0)); m++); 1;}
    is(k) = {my(e = factor(k)[, 2]); for(i = 1, #e, if(!isexp(e[i]), return(0))); 1;}

Formula

Sum_{n>=1} 1/a(n) = Product_{p prime} (1 + Sum_{k>=1} 1/p^A255411(k)) = 1.07819745085315583226... .
Showing 1-3 of 3 results.