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.

A328321 Numbers n for which A328311(n) = 1 + A051903(A003415(n)) - A051903(n) is strictly positive.

Original entry on oeis.org

4, 6, 10, 12, 14, 15, 16, 20, 21, 22, 26, 27, 28, 30, 33, 34, 35, 36, 38, 39, 42, 44, 46, 48, 50, 51, 52, 54, 55, 57, 58, 60, 62, 64, 65, 66, 68, 69, 70, 74, 76, 77, 78, 80, 82, 84, 85, 86, 87, 91, 92, 93, 94, 95, 99, 100, 102, 105, 106, 108, 110, 111, 112, 114, 115, 116, 118, 119, 122, 123, 124, 129, 130, 132, 133
Offset: 1

Views

Author

Antti Karttunen, Oct 13 2019

Keywords

Comments

Numbers n for which A051903(A003415(n)) >= A051903(n), i.e., numbers such that taking their arithmetic derivative does not decrease their "degree", A051903, the maximal exponent in prime factorization.

Examples

			10 = 2*5 has maximal exponent (A051903) 1, and its arithmetic derivative A003415(10) = 2+5 = 7 also has maximal exponent 1, thus 10 is included in this sequence.
15 = 3*5 has maximal exponent 1, and its arithmetic derivative A003415(15) = 3+5 = 8 = 2^3 has maximal exponent 3, thus 15 is included in this sequence.
For 8 = 2^3, its arithmetic derivative A003415(8) = 12 = 2^2 * 3, and as 2 < 3 (highest exponent of 12 is less than that of 8), 8 is NOT included here, and from this we also see that A100716 is not a subsequence of this sequence.
		

Crossrefs

Cf. A328320 (complement), A051674, A157037, A328304, A328305 (subsequences).

Programs

A328303 Numbers whose arithmetic derivative is not squarefree.

Original entry on oeis.org

0, 1, 4, 8, 12, 14, 15, 16, 20, 24, 27, 28, 32, 35, 36, 39, 40, 44, 46, 48, 50, 51, 52, 54, 55, 56, 60, 64, 65, 68, 72, 76, 77, 80, 81, 84, 86, 87, 88, 91, 92, 94, 95, 96, 99, 100, 104, 108, 111, 112, 115, 116, 119, 120, 122, 123, 124, 125, 128, 132, 135, 136, 138, 140, 141, 143, 144, 146, 148, 152, 155, 156, 158, 159, 160, 162, 164, 168, 172, 176, 180, 183, 184, 187, 188, 189, 192, 194, 196, 200
Offset: 1

Views

Author

Antti Karttunen, Oct 13 2019

Keywords

Comments

Numbers n for which either A003415(n) = 0 or A051903(A003415(n)) > 1.

Examples

			Arithmetic derivative of 1 is A003415(1) = 0, which is not a squarefree number (not in A005117), thus 1 is included in this sequence. Ditto for 0, as A003415(0) = 0.
Arithmetic derivative of 8 is A003415(8) = 12 = 2^2 * 3, which is not squarefree, thus 8 is included in this sequence.
Arithmetic derivative of 15 is A003415(15) = 8 = 2^3, which is not squarefree, thus 15 is included in this sequence.
		

Crossrefs

Complement of the union of A000040 and A328234.
Cf. A328245, A328251, A328253, A328304, A328305 (subsequences).

Programs

  • PARI
    A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
    isA328303(n) = !issquarefree(A003415(n));

A328305 Numbers that are cubefree, but not squarefree and whose first arithmetic derivative is not squarefree, but some k-th (with k >= 2) derivative is.

Original entry on oeis.org

50, 99, 207, 306, 531, 549, 725, 747, 819, 931, 1083, 1175, 1611, 1775, 1899, 2057, 2075, 2299, 2331, 2367, 2499, 2525, 2842, 2853, 2891, 3425, 3577, 3610, 3771, 3789, 3843, 4059, 4149, 4311, 4475, 4575, 4626, 4693, 4775, 4998, 5239, 5274, 5341, 5547, 5634, 5706, 5715, 5746, 5819, 5949, 6147, 6223, 6275, 6381, 6413, 6475, 6575
Offset: 1

Views

Author

Antti Karttunen, Oct 13 2019

Keywords

Comments

Numbers n for which A051903(n) = 2 and A328248(n) > 2.

Examples

			50 is not squarefree, as 50 = 2 * 5^2, and neither its arithmetic derivative A003415(50) = 45 = 3^2 * 5 is squarefree, but its second derivative A003415(45) = 39 = 3*13 is, thus 50 is included in this sequence.
		

Crossrefs

Programs

  • PARI
    A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
    A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
    A328248(n) = { my(k=1); while(n && !issquarefree(n), k++; n = A003415checked(n)); (!!n*k); };
    isA067259(n) = (2==A051903(n));
    isA328305(n) = (isA067259(n)&&(A328248(n)>2));
Showing 1-3 of 3 results.