A328585 -id:A328585 - cp's OEIS frontend

A328578 Index of the least prime not dividing A276086(A276086(n)): a(n) = A257993(A276087(n)).

2, 1, 3, 1, 4, 1, 3, 1, 4, 1, 5, 1, 2, 1, 5, 1, 4, 1, 3, 1, 6, 1, 6, 1, 2, 1, 6, 1, 7, 1, 2, 1, 4, 1, 3, 1, 3, 1, 5, 1, 6, 1, 2, 1, 6, 1, 6, 1, 3, 1, 7, 1, 7, 1, 2, 1, 7, 1, 5, 1, 2, 1, 5, 1, 4, 1, 3, 1, 6, 1, 6, 1, 2, 1, 7, 1, 7, 1, 3, 1, 7, 1, 8, 1, 2, 1, 6, 1, 8, 1, 2, 1, 6, 1, 7, 1, 3, 1, 7, 1, 7, 1, 2, 1, 7, 1

Offset: 0

Antti Karttunen, Oct 20 2019

Index of the least significant zero digit in the primorial base expansion of A276086(n), when the rightmost digit is in the position 1.

The scatter plot shows both regular looking as well as more chaotic regions. This can be more clearly seen in related A328579. See also A328839.

Antti Karttunen, Table of n, a(n) for n = 0..32768
Rémy Sigrist, Colored logarithmic scatterplot of the ordinal transform of the sequence for n = 0..510510
Rémy Sigrist, Density plot of the sequence for n = 0..510510
Index entries for sequences related to primorial base

Cf. A000720, A055396, A276086, A276087, A328403, A328570, A328579 (the corresponding prime), A328590, A328763, A328766, A328839.
Cf. A328585 (where equal with A257993), A328587 (less than), A328588 (greater than).
Cf. A328761 (the first occurrence of each n).
Cf. also array A328631 and its rows A005408, A328632, A328633, A328634, A328635, A328636 (positions of terms 1 .. 6 in this sequence).

A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328570(n) = { my(i=1, p=2); while(n && (n%p), i++; n = n\p; p = nextprime(1+p)); (i); };
A328578(n) = A328570(A276086(n));

A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
A328578(n) = A257993(A276086(A276086(n)));

a(n) = A328570(A276086(n)) = A257993(A276087(n)) = A055396(A328403(n)).
a(n) = A000720(A328579(n)).
a(n) = A257993(n) + A328590(n).
a(n) = A055396(A328763(n)).
For all n >= 0, a(A328761(n)) = n.

A328317 Smallest prime not dividing A328316(n), with a(0) = 1 by convention; Equally, for n > 0, smallest prime dividing A328316(1+n).

Original entry on oeis.org

1, 2, 3, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2

Offset: 0

Antti Karttunen, Oct 14 2019

a(2n+1) = 2 for all n >= 0. Does the pattern of 5's in the even bisection also continue?

Cf. A020639, A053669, A276086, A326810, A328316, A328318, A328319, A328322, A328323, A328585, A328586, A328633.

A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328316(n) = if(!n,0,A276086(A328316(n-1)));
A053669(n) = forprime(p=2, , if(n%p, return(p))); \\ From A053669
A328317(n) = if(0==n,1,A053669(A328316(n)));
\\ Or alternatively as:
A020639(n)=if(n>1, if(n>n=factor(n, 0)[1, 1], n, factor(n)[1, 1]), 1)
A328317(n) = A020639(A328316(1+n));

a(0) = 1; and for n > 0, a(n) = A053669(A328316(n)).
a(n) = A020639(A328316(1+n)).
For n >= 1, a(n) = A326810(A328316(n-1)). - Antti Karttunen, Nov 15 2019

a(12)-a(13) from Jinyuan Wang, Jul 20 2020

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

Antti Karttunen, Oct 21 2019

nonn

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.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences related to primorial base

Union of A328632 \ {0} and A328762.
Positions of negative terms in A328590.
Cf. A257993, A276086, A328578, A328585, A328586, A328588.

A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328578(n) = A257993(A276086(A276086(n)));
isA328587(n) = (A328578(n) < A257993(n));

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

Antti Karttunen, Oct 21 2019

nonn

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.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences related to primorial base

Cf. A257993, A276086, A328578, A328316, A328317, A328633.

Even terms in A328585. Cf. also A328587, A328588, A328589.

A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328578(n) = A257993(A276086(A276086(n)));
isA328586(n) = ((!(n%2))&&(A328578(n) == A257993(n)));

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

Antti Karttunen, Oct 21 2019

nonn

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.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences related to primorial base

Cf. A049345, A047235, A257993, A276086, A328578, A328585, A328586, A328587.
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.

A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328578(n) = A257993(A276086(A276086(n)));
isA328588(n) = (A328578(n) > A257993(n));

A328590 a(n) = A328578(n) - A257993(n).

Original entry on oeis.org

0, 1, 0, 2, 0, 0, 0, 2, 0, 3, 0, -1, 0, 3, 0, 2, 0, 0, 0, 4, 0, 4, 0, -1, 0, 4, 0, 5, 0, -2, 0, 2, 0, 1, 0, 0, 0, 3, 0, 4, 0, -1, 0, 4, 0, 4, 0, 0, 0, 5, 0, 5, 0, -1, 0, 5, 0, 3, 0, -2, 0, 3, 0, 2, 0, 0, 0, 4, 0, 4, 0, -1, 0, 5, 0, 5, 0, 0, 0, 5, 0, 6, 0, -1, 0, 4, 0, 6, 0, -2, 0, 4, 0, 5, 0, 0, 0, 5, 0, 5, 0, -1, 0, 5, 0

Offset: 1

Antti Karttunen, Oct 21 2019

sign

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to primorial base

Cf. A257993, A276086, A328578, A328585 (positions of zeros), A328587 (of negative terms), A328588 (of positive terms).

Cf. A328591 (even bisection).

A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328578(n) = A257993(A276086(A276086(n)));
A328590(n) = (A328578(n) - A257993(n));

a(n) = A328578(n) - A257993(n).

A328589 Numbers n that are multiples of 6 and 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

240, 270, 300, 330, 360, 390, 630, 660, 690, 720, 750, 780, 810, 1050, 1080, 1110, 1140, 1170, 1200, 1230, 1500, 1530, 1560, 1590, 1620, 1650, 1890, 1920, 1950, 1980, 2010, 2040, 2070, 2550, 2580, 2610, 2640, 2670, 2700, 2940, 2970, 3000, 3030, 3060, 3090, 3120, 3360, 3390, 3420, 3450, 3480, 3510, 3540, 3810, 3840, 3870, 3900, 3930, 3960, 4200

Offset: 1

Antti Karttunen, Oct 21 2019

nonn

Multiples of six such that the least nondivisor prime of the original n is less than the least nondivisor prime of the number obtained after two iterations of A276086 is.

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, so 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 then A328578(n) = A257993(A276086(A276086(n))) is definitely not larger than 3, while A257993(6k) >= 3 for all k >= 1.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences related to primorial base

Subsequence of A328588.
Other multiples of 6 are either in A328586 or in A328587.
Cf. A049345, A084967, A257993, A276086, A328578, A328585, A328588, A328590, A328762.

A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328578(n) = A257993(A276086(A276086(n)));
isA328589(n) = ((!(n%6))&&(A328578(n) > A257993(n)));

A328839 Smallest prime not dividing n times smallest prime not dividing A276087(n).

Original entry on oeis.org

4, 15, 4, 21, 4, 25, 4, 21, 4, 33, 4, 15, 4, 33, 4, 21, 4, 25, 4, 39, 4, 39, 4, 15, 4, 39, 4, 51, 4, 21, 4, 21, 4, 15, 4, 25, 4, 33, 4, 39, 4, 15, 4, 39, 4, 39, 4, 25, 4, 51, 4, 51, 4, 15, 4, 51, 4, 33, 4, 21, 4, 33, 4, 21, 4, 25, 4, 39, 4, 39, 4, 15, 4, 51, 4, 51, 4, 25, 4, 51, 4, 57, 4, 15, 4, 39, 4, 57, 4, 21, 4, 39, 4, 51, 4

Offset: 1

Antti Karttunen, Oct 29 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 1..32768
Index entries for sequences related to primorial numbers

Cf. A010709 (odd bisection), A053669, A276086, A276087, A328578, A328579.

Cf. A328585 (positions of the prime squares).

A053669(n) = forprime(p=2, , if(n%p, return(p))); \\ From A053669
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328579(n) = A053669(A276086(A276086(n)));
A328839(n) = (A053669(n) * A328579(n));

a(n) = A053669(n) * A328579(n).

cp's OEIS Frontend

A328578 Index of the least prime not dividing A276086(A276086(n)): a(n) = A257993(A276087(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Formula

A328317 Smallest prime not dividing A328316(n), with a(0) = 1 by convention; Equally, for n > 0, smallest prime dividing A328316(1+n).

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Formula

Extensions

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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A328590 a(n) = A328578(n) - A257993(n).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A328589 Numbers n that are multiples of 6 and 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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A328839 Smallest prime not dividing n times smallest prime not dividing A276087(n).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula