OFFSET
1,1
COMMENTS
For any prime p: when trailing zeros are removed from the terms written in base p, every positive integer not divisible by p appears (in base p) exactly once. For example, 4 is written "11" in base 3, and "11" appears when the trailing zeros are removed from "11000", which is the term 108 written in base 3.
Numbers m such that when the exponents e_1 .. e_k in the canonical factorization m = p_1^e_1 * ... * p_k^e_k are bitwise-xored together, the result is 1.
As a set, membership is determined by prime signature. It is a coset of A268390 within the positive integers under the binary operation A059897(.,.). Using standard arithmetic operations and any given prime p, this set can be derived from A268390 by dividing by p all the terms of A268390 whose squarefree part is a multiple of p and multiplying by p all the other terms of A268390.
FORMULA
EXAMPLE
30 = 2 * 3 * 5 is the product of an odd number of distinct primes times 1, and 1 is in A268390, so 30 is in the sequence.
72 = 2 * 6^2 is in the sequence since 2 is the product of 1 distinct prime and 6 is in A268390.
6 = 2 * 3 is the product of 2 (an even number) of distinct primes, so 6 is not in the sequence.
PROG
(PARI) isA374595 = A374130;
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen and Peter Munn, Jul 13 2024
STATUS
approved