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.

A321136 Reduced numbers with multiplicative persistence 12 in base 14.

Original entry on oeis.org

82092087348200531993, 112762935748501480133, 262718674122383875983, 263029749260219193811, 300390025745554034372, 1121144219125164400220, 1970210218466750664277, 3677727222739184127743, 3743399183079496964351, 4597158601038676586591, 16090049120558582236269
Offset: 1

Views

Author

A.H.M. Smeets, Oct 28 2018

Keywords

Comments

Let p_14(n) be the product of the digits of n in base 14. We can define an equivalence relation DP_14 on n by n DP_14 m if and only if p_14(n) = p_14(m); the naming DP_b for the equivalence relation stands for "digits product for representation in base b". A number n is called the class representative number of class n/DP_14 if and only if p_14(n) = p_14(m), m >= n; i.e., the smallest number of that class; it is also called the reduced number.
For any multiplicative persistence, except the multiplicative persistence 2, the set of class representative numbers with that multiplicative persistence is conjectured to be finite. Each class representative number represents an infinite set of numbers with the same multiplicative persistence.
If there exists more reduced numbers with multiplicative persistence 12, it will be larger than 14^100.
a(1) = A321135(12).

Crossrefs

A321137 Reduced numbers with multiplicative persistence 11 in base 14.

Original entry on oeis.org

18693488093783, 152662885954879, 152949075509508, 305363914228295, 322719194103095, 489085121468831, 549494859818967, 2075869423190275, 2084591547337851, 2084591547385087, 2136925978841723, 2141285475971935, 2197979373249743, 2198602382114711, 2935000346492647
Offset: 1

Views

Author

A.H.M. Smeets, Oct 28 2018

Keywords

Comments

Let p_14(n) be the product of the digits of n in base 14. We can define an equivalence relation DP_14 on n by n DP_14 m if and only if p_14(n) = p_14(m); the naming DP_b for the equivalence relation stands for "digits product for representation in base b". A number n is called the class representative number of class n/DP_14 if and only if p_14(n) = p_14(m), m >= n; i.e., the smallest number of that class; it is also called the reduced number.
For any multiplicative persistence, except the multiplicative persistence 2, the set of class representative numbers with that multiplicative persistence is conjectured to be finite. Each class representative number represents an infinite set of numbers with the same multiplicative persistence.If there exists more reduced numbers with multiplicative persistence 11, it will be larger than 14^100.
a(1) = A321135(11).

Examples

			The number 18693488093783 represented in base 14, with A..D for 10..13 is 288AABCCCDDD. Other numbers with the same reduced number are for instance 2248AABCCCDDD, 28825AABCCCDDD, 288AABCC26DDD, 1288AABCCCDDD; or any number obtained by permutation of the digits of those numbers.
		

Crossrefs

A321138 Reduced numbers with multiplicative persistence 10 in base 14.

Original entry on oeis.org

397912927, 5449646691, 7987762047, 8408836868, 8416865813, 14311910772, 95358760419, 95359835871, 119207613951, 119319977811, 178002991683, 181182645587, 268593608191, 780359955604, 781941158165, 802715724229, 985373000485, 986970420491, 1068017311927, 1068025296336
Offset: 1

Views

Author

A.H.M. Smeets, Oct 28 2018

Keywords

Comments

Let p_14(n) be the product of the digits of n in base 14. We can define an equivalence relation DP_14 on n by n DP_14 m if and only if p_14(n) = p_14(m); the naming DP_b for the equivalence relation stands for "digits product for representation in base b". A number n is called the class representative number of class n/DP_14 if and only if p_14(n) = p_14(m), m >= n; i.e., the smallest number of that class; it is also called the reduced number.
For any multiplicative persistence, except the multiplicative persistence 2, the set of class representative numbers with that multiplicative persistence is supposed to be finite. Each class representative number represents an infinite set of numbers with the same multiplicative persistence.
If there exists more reduced numbers with multiplicative persistence 10, it will be larger than 14^100.
a(1) = A321135(10).

Examples

			The number 397912927 represented in base 14, with A..D for 10..13 is 3ABBDDDD. Other numbers with the same reduced number are for instance 325BBDDDD or 13ABBDDDD; or any number obtained by permutation of the digits of those numbers.
		

Crossrefs

Showing 1-3 of 3 results.