A340377 -id:A340377 - cp's OEIS frontend

A340376 Numbers k such that there are no 1-digits in the ternary expansion of A048673(k).

2, 6, 7, 15, 22, 26, 43, 50, 54, 62, 65, 74, 77, 87, 94, 98, 103, 138, 183, 190, 198, 214, 218, 221, 235, 278, 302, 343, 353, 406, 421, 426, 430, 439, 463, 465, 467, 475, 498, 506, 534, 574, 578, 610, 633, 646, 662, 666, 682, 734, 799, 843, 862, 869, 870, 882, 886, 910, 949, 967, 977, 987, 1013, 1014, 1087, 1121

Offset: 1

Antti Karttunen, Jan 15 2021

nonn

Antti Karttunen, Table of n, a(n) for n = 1..20000
Index entries for sequences computed from indices in prime factorization

Positions of zeros in A304759 and in A340378. Positions of 2's in A340381.

Cf. A048673, A340377.

PARI
```
isA340376(n) = (0==A304759(n));
```

A341345 a(n) = A048673(n) mod 3.

Original entry on oeis.org

1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 1, 2, 0, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 0, 2, 1, 2, 1, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 1, 2, 0, 2, 1

Offset: 1

Antti Karttunen, Feb 09 2021

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from indices in prime factorization

Cf. A003961, A010872, A048673, A292247, A292248, A292251, A292252.
Cf. A007395 (even bisection), A341346 (odd bisection), A341347.
Cf. also A291759, A292243, A292244, A292245, A292246, A292250, A304759, A340376, A340377.
Cf. also A292603.

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A341345(n) = (((A003961(n)+1)/2)%3);

a(n) = A010872(A048673(n)).
a(n) = 0 iff A292247(n) is odd.
a(n) = 0 iff A292250(n) is odd, or equally, iff both A291759(n) and A304759(n) are even.
a(n) = 0 iff A292251(n) > 0.
a(n) = 1 iff A292248(n) is odd.
a(n) = 1 iff A304759(n) is odd, or equally, iff both A291759(n) and A292250(n) are even.
a(2n) = 2.

A340382 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(A291759(i)) = A278222(A291759(j)), for all i, j >= 1.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Jan 16 2021

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A278222, A291759, A304748, A340381,
Cf. A340377 (positions of ones).
Cf. also A305302.

up_to = 65537;
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289814
A291759(n) = A289814(A048673(n));
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A278222(n) = A046523(A005940(1+n));
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
v340382 = rgs_transform(vector(up_to,n,A278222(A291759(n))));
A340382(n) = v340382[n];

A340379 Number of 2-digits in the ternary representation of A048673(n).

Original entry on oeis.org

0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 2, 0, 2, 1, 1, 0, 1, 0, 1, 0, 2, 1, 2, 2, 3, 1, 2, 1, 3, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 0, 2, 2, 3, 1, 3, 0, 4, 1, 2, 1, 2, 0, 3, 1, 2, 1, 1, 2, 2, 0, 1, 2, 2, 0, 1, 0, 3, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 1, 2, 0, 2, 0, 4, 0, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1

Offset: 1

Antti Karttunen, Jan 15 2021

nonn

Binary weight of A291759(n).

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from indices in prime factorization

Cf. A000120, A048673, A081603, A286585, A291759, A292252.

Cf. A340377 (positions of zeros).

A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289814
A291759(n) = A289814(A048673(n));
A340379(n) = hammingweight(A291759(n));

a(n) = A081603(A048673(n)) = A000120(A291759(n)).
a(n) = (A286585(n) - A340378(n)) / 2.
For all n >= 1, a(n) >= A292252(n).

cp's OEIS Frontend

A340376 Numbers k such that there are no 1-digits in the ternary expansion of A048673(k).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A341345 a(n) = A048673(n) mod 3.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A340382 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(A291759(i)) = A278222(A291759(j)), for all i, j >= 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A340379 Number of 2-digits in the ternary representation of A048673(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula