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-5 of 5 results.

A328587 Numbers n for which A257993(A276086(A276086(n))) is less than A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.

Original entry on oeis.org

12, 24, 30, 42, 54, 60, 72, 84, 90, 102, 114, 120, 132, 144, 150, 162, 174, 180, 192, 204, 210, 216, 228, 246, 258, 276, 288, 306, 318, 336, 348, 366, 378, 396, 408, 420, 432, 444, 450, 462, 474, 480, 492, 504, 510, 522, 534, 540, 552, 564, 570, 582, 594, 600, 612, 624, 636, 648, 666, 678, 696, 708, 726, 738, 756, 768, 786, 798, 816
Offset: 1

Views

Author

Antti Karttunen, Oct 21 2019

Keywords

Comments

Numbers n for which A328578(n) is less than A257993(n).
All terms are multiples of 6. The final digit {0, 2, 4, 6, 8} of the decimal representation seems to be quite evenly distributed.
Other multiples of six are in A328586 and A328589.
210 is the first term not present in A328632.

Crossrefs

Union of A328632 \ {0} and A328762.
Positions of negative terms in A328590.

Programs

A328586 Even numbers n for which A257993(n) is equal to A257993(A276086(A276086(n))), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.

Original entry on oeis.org

6, 18, 36, 48, 66, 78, 96, 108, 126, 138, 156, 168, 186, 198, 222, 234, 252, 264, 282, 294, 312, 324, 342, 354, 372, 384, 402, 414, 426, 438, 456, 468, 486, 498, 516, 528, 546, 558, 576, 588, 606, 618, 642, 654, 672, 684, 702, 714, 732, 744, 762, 774, 792, 804, 822, 834, 846, 858, 876, 888, 906, 918, 936, 948, 966, 978, 996, 1008
Offset: 1

Views

Author

Antti Karttunen, Oct 21 2019

Keywords

Comments

All terms are multiples of 6, but very few multiples of 5 (and thus of 10) are present: the first ones are at a(169) = 2520 and a(254) = 3780. Among the first 10000 terms, there are only 28 ending with decimal digit 0, while those that end with either 2 or 4 are 2450 both, and with either 6 or 8, both have 2536 each.
Other multiples of six are in A328587 and A328589.

Crossrefs

Programs

A328588 Numbers n for which A257993(A276086(A276086(n))) is larger than A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.

Original entry on oeis.org

2, 4, 8, 10, 14, 16, 20, 22, 26, 28, 32, 34, 38, 40, 44, 46, 50, 52, 56, 58, 62, 64, 68, 70, 74, 76, 80, 82, 86, 88, 92, 94, 98, 100, 104, 106, 110, 112, 116, 118, 122, 124, 128, 130, 134, 136, 140, 142, 146, 148, 152, 154, 158, 160, 164, 166, 170, 172, 176, 178, 182, 184, 188, 190, 194, 196, 200, 202, 206, 208, 212, 214, 218, 220, 224, 226, 230, 232, 236, 238, 240, 242
Offset: 1

Views

Author

Antti Karttunen, Oct 21 2019

Keywords

Comments

Numbers n for which A328578(n) > A257993(n).
A047235 (numbers that are congruent to {2, 4} mod 6, thus even numbers that are not multiples of 3, with A257993(n) = 1) is a subsequence, because in primorial base (A049345) such numbers end with digits "10" or "20". A276086 will convert such a number to a number of the form p_k^e_k * ... * 7^b * 5^a * 3^{1,2} * 2^0 (an odd multiple of three, thus of the form 6k+3) which in primorial base will end with digits "11", thus on the second iteration A276086 will convert that to a number of the form p_k^e_k * ... * 7^b * 5^a * 3^1 * 2^1, with the least missing prime having an index (A257993) at least 3, which is larger than the original 1. Thus all terms of A047235 are included in this sequence.

Crossrefs

Union of A047235 (terms of the form 6k+2 and 6k+4) and A328589 (gives the terms that are multiples of 6).
Positions of positive terms in A328590.
Differs from A047235 for the first time at n=81, with a(81) = 240, a term not present in A047235.

Programs

A328633 Numbers n for which A328578(n) = A257993(A276086(A276086(n))) = 3, where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.

Original entry on oeis.org

2, 6, 18, 34, 36, 48, 66, 78, 96, 108, 122, 126, 138, 154, 156, 168, 186, 198, 212, 222, 234, 244, 252, 264, 282, 294, 312, 324, 332, 342, 354, 364, 372, 384, 402, 414, 422, 426, 438, 454, 456, 468, 486, 498, 516, 528, 542, 546, 558, 574, 576, 588, 606, 618, 632, 642, 654, 664, 672, 684, 702, 714, 732, 744, 752, 762, 774, 784, 792, 804
Offset: 1

Views

Author

Antti Karttunen, Oct 27 2019

Keywords

Comments

Numbers n for which A276087(n) is a multiple of 6, but not of 5.
Question: Is the even bisection of A328316, starting from A328316(4) as: 6, 18, 43218, ..., a subsequence of this sequence? See also A328317.
Subsequence such that both k and A276087(k) are in this sequence starts as: 2, 6, 18, 34, 36, 48, 66, 154, 156, 186, 234, 244, 294, 312, 324, 354, 364, 384, 426, 438, 454, 456, 542, 546, 558, 588, 606, ...
When A276086 is applied to any number which is a multiple of 6, but not of 5 (and thus not a multiple of 30, implying that the number's primorial expansion ends with "x00", where x <> 0, and A257993(n) = 3), the original number will be converted to a number of the form 30k+5 or 30k+25 (A084967) whose primorial expansion ends either as "...021" or as "...401", with the least significant zero in position A328578(n), which is seen to be always either 3 or 2.

Examples

			294 = 7^2 * 3 * 2 has primorial base expansion (A049345) "12400", which, when converted to a prime product form (A276086) yields 11^1 * 7^2 * 5^4 * 3^0 * 2^0 = 336875. This in turn has primorial base representation [11,2,9,1,0,2,1], which when converted to prime product form gives 17^11 * 13^2 * 11^9 * 7^1 * 5^0 * 3^2 * 2^1 = 1720796647657111567992931482, which has the required property of being a multiple of 6 but not of 5, thus 294 is included in this sequence.
		

Crossrefs

Programs

A328762 Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.

Original entry on oeis.org

210, 1470, 5250, 6510, 7140, 8400, 9450, 10710, 14490, 15750, 16380, 17640, 18690, 19950, 23730, 24990, 25620, 26880, 27930, 29190, 30030, 31290, 32340, 33600, 37380, 38640, 39270, 40530, 41580, 42840, 46620, 47880, 48510, 49770, 50820, 52080, 55860, 57120, 57750, 59010, 60270, 61530, 63420, 65730, 69510, 70770, 72660, 74970
Offset: 1

Views

Author

Antti Karttunen, Oct 27 2019

Keywords

Comments

All terms are multiples of 5 (and thus of 30), because when applied to any number which is a multiple of 6, but not of 5 (and thus not a multiple of 30, implying that the primorial expansion ends with "x00", where x <> 0, and A257993(n) = 3), A276086 will yield a number of the form 30k+5 or 30k+25 (A084967) whose primorial expansion ends either as "...021" or as "...401" (with the least significant zero either in position 2 or 3), thus A328578(n) = A257993(A276086(A276086(n))) cannot simultaneously be larger than 2 and smaller than A257993(n).

Crossrefs

Setwise difference A328587 \ A328632.

Programs

Showing 1-5 of 5 results.