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.

A351228 Numbers k for which A003415(k) >= A276086(k), where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.

Original entry on oeis.org

6, 30, 32, 36, 60, 210, 212, 213, 214, 216, 240, 420, 2310, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2322, 2324, 2328, 2340, 2342, 2343, 2344, 2346, 2348, 2349, 2352, 2370, 2372, 2376, 2400, 2520, 2522, 2523, 2524, 2526, 2528, 2550, 2552, 2730, 4620, 4622, 4623, 4624, 4626, 4628, 4632, 4650, 4652, 4656
Offset: 1

Views

Author

Antti Karttunen, Feb 05 2022

Keywords

Comments

Conjecture: Apart from the initial 6, the rest of terms are the numbers k for which A003415(k) > A276086(k), thus giving the positions of zeros in A351232. In other words, it seems that only k=6 satisfies A003415(k) = A276086(k). See also comments in A351088.

Links

Crossrefs

Cf. A003415, A024451, A048103, A060735, A235991, A276085, A276086, A327862, A351088, A351089, A351232, A369656, A369663, A369664, A371104.
Union of A370127 and A370128.
Subsequence of A328118.
Subsequences: A351229, A369959, A369960, A369970 (after its two initial terms).
Cf. also A369650.

Programs

  • PARI
    A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
isA351228(n) = (A003415(n)>=A276086(n));

A369960 Numbers k such that A003415(k) >= A276086(k) and gcd(k, A003415(k)) = gcd(k, A276086(k)) > 1, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.

Original entry on oeis.org

2313, 30033, 30069, 30249, 30282, 32350, 32553, 60093, 60273, 510550, 510561, 510579, 510633, 510723, 510741, 513063, 540963, 542853, 570573, 572910, 1021023, 1021062, 1021239, 1023363, 1531539, 1561563, 9699741, 9699746, 9699759, 9699903, 9699942, 9699957, 9699965, 9700150, 9700353, 9702009, 9702027, 9702049, 9702121
Offset: 1

Views

Author

Antti Karttunen, Feb 07 2024

Keywords

Links

Crossrefs

Intersection of A351228 and A369963.
Subsequence of the following sequences: A013929, A369958, A369959, A369962.
Cf. A003415, A060735, A083345, A085731, A276086, A324198, A351251.

Programs

  • PARI
    A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
isA369960(n) = { my(t=A003415(n), u=A276086(n), g=gcd(n,t), h=gcd(n,u)); ((t >= u) && (g==h) && (g>1)); };
isA369960(n) = if(!n || issquarefree(n), 0, my(t=A003415(n), u=A276086(n), g=gcd(n,t), h=gcd(n,u)); ((t >= u) && (g==h)));
  • PARI
    A085731(n) = { my(f=factor(n)); for(i=1, #f~, if (f[i, 2] % f[i, 1], f[i, 2]--); ); factorback(f); };
A324198(n) = { my(m=1, p=2, orgn=n); while(n, m *= (p^min(n%p, valuation(orgn, p))); n = n\p; p = nextprime(1+p)); (m); };
isA369960(n) = if(!n || issquarefree(n),0,((A085731(n) == A324198(n)) && (A003415(n) >= A276086(n))));

Formula

{k | A085731(n) > 1 and A085731(n) == A324198(n) and A083345(k) >= A351251(k)}.

A369962 Numbers k for which gcd(k, A003415(k)) is equal to gcd(k, A276086(k)), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.

Original entry on oeis.org

1, 2, 5, 6, 7, 9, 11, 13, 14, 17, 19, 22, 23, 26, 29, 30, 31, 34, 37, 38, 41, 43, 46, 47, 49, 53, 58, 59, 61, 62, 65, 66, 67, 71, 73, 74, 78, 79, 82, 83, 86, 89, 94, 95, 97, 99, 101, 102, 103, 106, 107, 109, 113, 114, 117, 118, 122, 127, 131, 134, 137, 138, 139, 142, 143, 146, 149, 151, 153, 155, 157, 158, 163, 166
Offset: 1

Views

Author

Antti Karttunen, Feb 07 2024

Keywords

Links

Crossrefs

Cf. A003415, A085731, A276086, A324198, A369961 (characteristic function).
Subsequences: A045344, A369959, A369963 (nonsquarefree terms).

Programs

Formula

{k | A085731(k) == A324198(k)}.

A369958 Numbers k such that A003415(k)/gcd(k, A003415(k)) >= A276086(k)/gcd(k, A276086(k)), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.

Original entry on oeis.org

6, 30, 33, 42, 63, 210, 212, 213, 214, 220, 420, 429, 462, 2310, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2325, 2330, 2340, 2342, 2343, 2344, 2345, 2346, 2355, 2370, 2373, 2379, 2380, 2520, 2522, 2526, 2530, 2535, 2552, 2730, 3003, 4620, 4622, 4623, 4626, 4628, 4630, 4654, 4680, 4830, 4836, 4862, 6930, 6942, 7150
Offset: 1

Views

Author

Antti Karttunen, Feb 07 2024

Keywords

Links

Crossrefs

Cf. A003415, A083345, A276086, A351251.
Subsequences: A002110 (after its two initial terms), A369959, A369960.
Cf. also A351228.

Programs

  • PARI
    A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
isA369958(n) = ((A003415(n)/gcd(n, A003415(n))) >= (A276086(n)/gcd(n, A276086(n))));

Formula

{k | A083345(k) >= A351251(k)}.
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.