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.

A359889 Numbers that are 1 or whose prime indices have the same mean as median.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 67, 69, 71, 73, 74, 77, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94
Offset: 1

Views

Author

Gus Wiseman, Jan 22 2023

Keywords

Comments

First differs from A236510 in having 252 (prime indices {1,1,2,2,4}).
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The prime indices of 900 are {1,1,2,2,3,3}, with mean 2 and median 2, so 900 is in the sequence.
		

Crossrefs

These partitions are counted by A240219, strict A359897.
The LHS (mean of prime indices) is A326567/A326568.
The complement is A359890, counted by A359894.
The odd-length case is A359891, complement A359892, counted by A359895.
The RHS (median of prime indices) is A360005/2.
A058398 counts partitions by mean, see also A008284, A327482.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A359893 and A359901 count partitions by median, odd-length A359902.
A359908 lists numbers whose prime indices have integer median.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],#==1||Mean[prix[#]]==Median[prix[#]]&]

Formula

Numbers n such that A326567(n)/A326568(n) = A360005(n)/2.

A242414 Numbers whose prime factorization viewed as a tuple of nonzero powers is palindromic.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95, 97, 100
Offset: 1

Views

Author

Antti Karttunen, May 30 2014

Keywords

Comments

The fixed points of permutation A069799.
Differs from its subsequence, A072774, Powers of squarefree numbers, for the first time at n=68, as here a(68) = 90 is included, as 90 = p_1^1 * p_2^2 * p_3^1 has a palindromic tuple of exponents, even although not all of them are identical.
Differs from its another subsequence, A236510, in that, although numbers like 42 = 2^1 * 3^1 * 5^0 * 7^1, with a non-palindromic exponent-tuple (1,1,0,1) are excluded from A236510, it is included in this sequence, because here only the nonzero exponents are considered, and (1,1,1) is a palindrome.
Differs from A085924 in that as that sequence is subtly base-dependent, it excludes 1024 (= 2^10), as then the only exponent present, 10, and thus also its concatenation, "10", is not a palindrome when viewed in decimal base. On the contrary, here a(691) = 1024.

Examples

			As 1 has an empty factorization, (), which also is a palindrome, 1 is present.
As 42 = 2 * 3 * 7 = p_1^1 * p_2^1 * p_4^1, and (1,1,1) is palindrome, 42 is present.
As 90 = 2 * 9 * 5 = p_1^1 * p_2^2 * p_3^1, and (1,2,1) is palindrome, 90 is present.
Any prime power (A000961) is present, as such numbers have a factorization p^e (e >= 1), and any singleton sequence (e) by itself forms a palindrome.
		

Crossrefs

Fixed points of A069799.
Complement: A242416.
A000961, A072774 and A236510 are subsequences.

Programs

  • Mathematica
    Select[Range[100], PalindromeQ[FactorInteger[#][[All, 2]]]&] (* Jean-François Alcover, Feb 09 2025 *)

A293448 Self-inverse permutation of natural numbers: replace (with multiplicity) each prime factor A000040(k) with A000040(min+(max-k)) in the prime factorization of n, where min = A055396(n) and max = A061395(n).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 18, 13, 14, 15, 16, 17, 12, 19, 50, 21, 22, 23, 54, 25, 26, 27, 98, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 250, 41, 70, 43, 242, 75, 46, 47, 162, 49, 20, 51, 338, 53, 24, 55, 686, 57, 58, 59, 150, 61, 62, 147, 64, 65, 154, 67, 578, 69, 42, 71, 108, 73, 74, 45, 722, 77, 286, 79, 1250, 81, 82, 83
Offset: 1

Views

Author

Antti Karttunen, Nov 09 2017

Keywords

Comments

Reverse the prime-indices in such a way that the smallest and the greatest prime dividing n (A020639 and A006530) are preserved.
a(n) = n iff n belongs to A236510. - Rémy Sigrist, Nov 22 2017

Examples

			For n = 25 = 5^2 = prime(3)^2, thus min = max = 3, and we form a product prime(3+(3-3))^2, thus a(25) = prime(3)^2 = 25.
For n = 42 = 2*3*7 = prime(1)*prime(2)*prime(4), thus min = 1 and max = 4, so we form a product prime(1+(4-1))*prime(1+(4-2))*prime(1+(4-4)), thus a(42) = prime(4)*prime(3)*prime(1) = 7*5*2 = 70.
For n = 126 = 2 * 3^2 * 7 = prime(1) * prime(2)^2 * prime(4), thus min = 1 and max = 4, so we form a product prime(1+(4-1)) * prime(1+(4-2))^2 * prime(1+(4-4)), thus a(126) = prime(4) * prime(3)^2 * prime(1) = 7 * 5^2 * 2 = 350.
		

Crossrefs

Cf. A000720, A055396, A057889, A061395, A236510 (fixed points), A273258.
Differs from A069799 (and some other related permutations) for the first time at n=42.

Programs

  • PARI
    A293448(n) = { if(1==n,return(n)); my(f=factor(n), mini = primepi(f[1, 1]), maxi = primepi(f[#f~, 1])); for(i=1,#f~,f[i,1] = prime((maxi-primepi(f[i,1]))+mini)); factorback(f); }

Formula

For all even squarefree numbers coincides with A273258, that is, for all n, a(A039956(n)) = A273258(A039956(n)).

A085924 If k = product (p_i)^(r_i), where p_i are primes in increasing order, then k is a member if concatenation of r_i as decimal numbers forms a palindrome.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95
Offset: 0

Views

Author

Amarnath Murthy and Jason Earls, Jul 12 2003

Keywords

Comments

2^10 is the first member of A072774 that is not in this sequence. - David Wasserman, Feb 11 2005
Note: A242414 is a new version of this sequence, which does not have this defect. - Antti Karttunen, May 30 2014
42 is the first member of this sequence that is not in A236510. - N. J. A. Sloane, Jan 27 2014

Examples

			15 is a member as 15 = 3^1*5^1 and 11 is a palindrome.
90 is a member as 90 = 2^1*3^2*5^1 and 121 is a palindrome.
84 is not a member as 84 = 2^2*3^1*7^1, 211 is not a palindrome.
1024 is not a member as 1024 = 2^10, and decimal number string "10" is not a palindrome.
		

Crossrefs

Differs from a non-base version of this sequence, A242414, in that here terms like 1024 are excluded (please see the Example section), while in latter, A242414(691) = 1024.

Extensions

More terms from David Wasserman, Feb 11 2005
Dependence on decimal number system highlighted and a link to the new version, A242414, added by Antti Karttunen, May 30 2014
Showing 1-4 of 4 results.