A028260 -id:A028260 - cp's OEIS frontend

A065043 Characteristic function of the numbers with an even number of prime factors (counted with multiplicity): a(n) = 1 if n = A028260(k) for some k then 1 else 0.

1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0

Offset: 1

Reinhard Zumkeller, Nov 05 2001

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537 (first 1000 terms from Harry J. Smith)
Index entries for characteristic functions
Index entries for sequences computed from exponents in factorization of n

Characteristic function of A028260 (positions of 1's). Cf. also A026424 (positions of 0's) and A320655.
One less than A007421.
Cf. A003961, A008836, A010052, A038548 (inverse Möbius transform), A046523, A055037 (partial sums), A343784, A347102, A353337, A353338, A353555, A353557, A353629, A353669, A358750, A358752, A353374, A358775, A356163, A356170.
Cf. also A066829, A353374.

A065043 := proc(n)
    if type(numtheory[bigomega](n),'even') then
        1;
    else
        0;
    end if;
end proc: # R. J. Mathar, Jun 26 2013

Table[(LiouvilleLambda[n]+1)/2,{n,1,20}] (* Enrique Pérez Herrero, Jul 07 2012 *)

{ for (n=1, 1000, a=1 - bigomega(n)%2; write("b065043.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 04 2009

A065043(n) = (1 - (bigomega(n)%2)); \\ Antti Karttunen, Apr 19 2022

from operator import ixor
from functools import reduce
from sympy import factorint
def A065043(n): return (reduce(ixor, factorint(n).values(),0)&1)^1 # Chai Wah Wu, Jan 01 2023

a(n) = 1 - A001222(n) mod 2.
a(n) = A007421(n) - 1.
a(n) = 1 - A066829(n).
a(A028260(k)) = 1 and a(A026424(k)) = 0 for all k.
Dirichlet g.f.: (zeta(s)^2 + zeta(2*s))/(2*zeta(s)). - Enrique Pérez Herrero, Jul 06 2012
a(n) = (A008836(n) + 1)/2. - Enrique Pérez Herrero, Jul 07 2012
a(n) = A001222(2n) mod 2. - Wesley Ivan Hurt, Jun 22 2013
G.f.: Sum_{n>=1} a(n)*x^n/(1 - x^n) = Sum_{n>=1} x^(n^2)/(1 - x^n). - Ilya Gutkovskiy, Apr 25 2017
From Antti Karttunen, Dec 01 2022: (Start)
For x, y >= 1, a(x*y) = 1 - abs(a(x)-a(y)).
a(n) = a(A046523(n)) = A356163(A003961(n)).
a(n) = A000035(A356163(n)+A347102(n)).
a(n) = A010052(n) + A353669(n).
a(n) = A353555(n) + A353557(n).
a(n) = A358750(n) + A358752(n).
a(n) = A353374(n) + A358775(n).
a(n) >= A356170(n).
(End)

Corrected by Charles R Greathouse IV, Sep 02 2009

A244152 Self-inverse permutation of natural numbers: a(1) = 1; thereafter, if n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = A028260(1+a(k)), otherwise, when n is k-th number > 1 with an even number of prime divisors [i.e., n = A028260(1+k)], a(n) = A026424(a(k)).

Original entry on oeis.org

1, 4, 10, 2, 24, 7, 6, 55, 18, 3, 16, 15, 121, 44, 12, 11, 39, 9, 36, 35, 105, 31, 250, 5, 29, 28, 93, 26, 25, 86, 22, 82, 238, 79, 20, 19, 81, 72, 17, 68, 218, 65, 517, 14, 62, 67, 60, 202, 195, 57, 59, 56, 185, 477, 8, 52, 50, 175, 51, 47, 177, 45, 495, 167, 42, 161, 46, 40, 162, 169, 150, 38, 143, 455, 459, 140, 153, 1060, 34, 134, 37, 32

Offset: 1

Antti Karttunen, Jul 27 2014

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for sequences that are permutations of the natural numbers

Cf. A008836, A026424, A028260, A055037, A055038, A066829.

Similar entanglement permutations: A245603-A245604, A235491, A236854, A243347, A244319.

a(1) = 1, and for n > 1, if A066829(n) = 1, then a(n) = A028260(1 + A244152(A055038(n))), otherwise a(n) = A026424(A244152(A055037(n)-1)).

For all n > 1, A008836(a(n)) = -1 * A008836(n), where A008836 is Liouville's lambda-function.

A245603 Permutation of natural numbers: a(1) = 1; thereafter, if n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = 2a(k), otherwise, when n is k-th number > 1 with an even number of prime divisors [i.e., n = A028260(1+k)], a(n) = 1+(2a(k)).

Original entry on oeis.org

1, 2, 4, 3, 8, 5, 6, 16, 9, 7, 10, 12, 32, 17, 11, 13, 18, 14, 20, 24, 33, 19, 64, 15, 21, 25, 34, 22, 26, 36, 28, 40, 65, 35, 23, 27, 48, 37, 29, 41, 66, 38, 128, 30, 42, 49, 50, 68, 67, 44, 39, 52, 72, 129, 31, 43, 51, 69, 56, 45, 80, 53, 130, 73, 57, 70, 46, 54, 81, 96, 74, 58, 82, 131, 132, 76, 71, 256, 60

Offset: 1

Antti Karttunen, Jul 27 2014

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for sequences that are permutations of the natural numbers

Inverse: A245604.
Cf. A026424, A028260, A066829, A055037, A055038.
Similar permutations: A143692, A244152, A244321, A245613, A245605, A245607.

a(1) = 1, and for n > 1, if A066829(n) = 1, then a(n) = 2 * A245603(A055038(n)), otherwise a(n) = 1 + (2 * A245603(A055037(n)-1)).
As a composition of related permutations:
a(n) = A244321(A245613(n)).
For all n >= 1, A000035(a(n)) = 1 - A066829(n). [Permutation A143692 has the same property.]

A245604 Permutation of natural numbers: a(1)=1, a(2n) = A026424(a(n)), a(2n+1) = A028260(1+a(n)).

Original entry on oeis.org

1, 2, 4, 3, 6, 7, 10, 5, 9, 11, 15, 12, 16, 18, 24, 8, 14, 17, 22, 19, 25, 28, 35, 20, 26, 29, 36, 31, 39, 44, 55, 13, 21, 27, 34, 30, 38, 42, 51, 32, 40, 45, 56, 50, 60, 67, 81, 37, 46, 47, 57, 52, 62, 68, 82, 59, 65, 72, 86, 79, 93, 105, 121, 23, 33, 41, 49, 48, 58, 66, 77, 53, 64, 71, 85, 76, 90, 99, 111, 61

Offset: 1

Antti Karttunen, Jul 27 2014

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for sequences that are permutations of the natural numbers

Inverse: A245603.

Similar permutations: A143691, A244152, A244322, A245614, A245606, A245608.

a(1)=1, a(2n) = A026424(a(n)), a(2n+1) = A028260(1+a(n)).
As a composition of related permutations:
a(n) = A245614(A244322(n)).
For all n >= 1, A066829(a(n)) = 1 - A000035(n). [Permutation A143691 has the same property].
Equally, A066829(a(n)*a(n+1)) = 1 for all n.

A245613 Permutation of natural numbers: a(1) = 1; thereafter, if n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = A244991(a(k)), otherwise, when n is k-th number > 1 with an even number of prime divisors [i.e., n = A028260(1+k)], a(n) = A244990(1+a(k)).

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 5, 16, 9, 7, 11, 10, 32, 18, 13, 12, 17, 15, 22, 20, 35, 19, 66, 14, 24, 21, 34, 25, 23, 33, 31, 45, 63, 37, 27, 26, 41, 36, 29, 43, 69, 40, 134, 30, 47, 39, 44, 68, 71, 50, 38, 46, 67, 131, 28, 49, 42, 70, 64, 52, 92, 48, 127, 65, 61, 75, 55, 51, 89, 83, 73, 60

Offset: 1

Antti Karttunen, Jul 27 2014

nonn

This shares with the permutation A122111 the property that each term of A028260 is mapped to a unique term of A244990 and each term of A026424 is mapped to a unique term of A244991.

Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for sequences that are permutations of the natural numbers

Inverse: A245614.
Cf. A026424, A028260, A055037, A055038, A066829, A244990, A244991, A244992, A122111.
Similar entanglement permutations: A243287, A243343, A243345, A244321-A244322, A245603, A135141, A237427, A245605.

a(1) = 1, and for n > 1, if A066829(n) = 1, a(n) = A244991(a(A055038(n))), otherwise a(n) = A244990(1+a(A055037(n)-1)).
As a composition of related permutations:
a(n) = A244322(A245603(n)).
For all n >= 1, A066829(n) = A244992(a(n)).

A245614 Permutation of natural numbers: a(1)=1; thereafter, if n is k-th number whose greatest prime factor has an odd index [i.e., n = A244991(k)], a(n) = A026424(a(k)), otherwise, when n is k-th number whose greatest prime factor has an even index [i.e., n = A244990(1+k)], a(n) = A028260(1+a(k)).

Original entry on oeis.org

1, 2, 4, 3, 7, 6, 10, 5, 9, 12, 11, 16, 15, 24, 18, 8, 17, 14, 22, 20, 26, 19, 29, 25, 28, 36, 35, 55, 39, 44, 31, 13, 30, 27, 21, 38, 34, 51, 46, 42, 37, 57, 40, 47, 32, 52, 45, 62, 56, 50, 68, 60, 82, 81, 67, 121, 86, 93, 105, 72, 65, 79, 33, 59, 64, 23, 53, 48, 41, 58, 49, 85, 71, 77, 66, 111, 99

Offset: 1

Antti Karttunen, Jul 27 2014

This shares with the permutation A122111 the property that each term of A244990 is mapped to a unique term of A028260 and each term of A244991 is mapped to a unique term of A026424.

Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for sequences that are permutations of the natural numbers

Inverse: A245613.
Cf. A026424, A028260, A066829, A244988, A244989, A244990, A244991, A244992, A122111.
Similar permutations: A244321, A244322, A245604, A227413, A237126, A243288, A243344, A243346, A245606.

a(1) = 1, and for n > 1, if A244992(n) = 1, a(n) = A026424(a(A244989(n))), otherwise a(n) = A028260(1+a(A244988(n)-1)).
As a composition of related permutations:
a(n) = A245604(A244321(n)).
For all n >= 1, A244992(n) = A066829(a(n)).

A353337 Number of ways to write n as a product of the terms of A028260 larger than 1; a(1) = 1 by convention (an empty product).

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Apr 17 2022

nonn

Number of factorizations of n into factors k > 1 for which there is an even number of primes (when counted with multiplicity, A001222) in their prime factorization.

			Of the eleven divisors of 96 larger than one, the following: [4, 6, 16, 24, 96] are terms of A028260 because they have an even number of prime factors when counted with repetition. Using them, we can factor 96 in four possible ways, as 96 = 24*4 = 16*6 = 6*4*4, therefore a(96) = 4.

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

Cf. A001222, A028260, A038548, A046523, A065043, A353338 [= a(n^2)].

Cf. also A320655, A353377.

A065043(n) = (1 - (bigomega(n)%2));
A353337(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1)&&(d<=m)&&A065043(d), s += A353337(n/d, d))); (s));

a(n) = a(A046523(n)). [The sequence depends only on the prime signature of n].

For all n >= 1, a(n) >= A320655(n), and a(n) >= A353377(n).

A143692 Permutation of natural numbers: If n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = 2k, otherwise, when n is k-th number with an even number of prime divisors [i.e., n = A028260(k)], a(n) = (2k)-1.

Original entry on oeis.org

1, 2, 4, 3, 6, 5, 8, 10, 7, 9, 12, 14, 16, 11, 13, 15, 18, 20, 22, 24, 17, 19, 26, 21, 23, 25, 28, 30, 32, 34, 36, 38, 27, 29, 31, 33, 40, 35, 37, 39, 42, 44, 46, 48, 50, 41, 52, 54, 43, 56, 45, 58, 60, 47, 49, 51, 53, 55, 62, 57, 64, 59, 66, 61, 63, 68, 70, 72, 65, 74, 76, 78

Offset: 1

Reinhard Zumkeller, Aug 29 2008

nonn

a(a(n)) = A143694(n).

Antti Karttunen, Table of n, a(n) for n = 1..8192
Index entries for sequences that are permutations of the natural numbers

Inverse: A143691.

Cf. A000035, A055037, A055038, A066829, A143694, A245603.

import Data.List (elemIndex); import Data.Maybe (fromJust)
a243692 = (+ 1) . fromJust . (`elemIndex` a143691_list)
-- Reinhard Zumkeller, Aug 07 2014

N:= 1000: # to get a(1) to a(N)
Odds,Evens:= selectremove(t -> numtheory:-bigomega(t)::odd,[$1..N]):
for k from 1 to nops(Odds) do A[Odds[k]]:= 2*k od:
for k from 1 to nops(Evens) do A[Evens[k]]:= 2*k-1 od:
seq(A[k],k=1..N); # Robert Israel, Jul 27 2014

m = 100;
odds = Select[Range[m], OddQ[PrimeOmega[#]]&];
evens = Select[Range[m], EvenQ[PrimeOmega[#]]&];
Do[a[odds[[k]]] = 2k, {k, 1, Length[odds]}];
Do[a[evens[[k]]] = 2k-1, {k, 1, Length[evens]}];
Array[a, m] (* Jean-François Alcover, Mar 09 2019, from Maple *)

From Antti Karttunen, Jul 27 2014: (Start)
If A066829(n) = 1, then a(n) = 2 * A055038(n), otherwise a(n) = (2 * A055037(n)) - 1.
For all n >= 1, A000035(a(n)) = 1 - A066829(n). [Permutation A245603 has the same property].
(End)

Name changed by Antti Karttunen, Jul 27 2014

A353338 Number of ways to write the square of n as a product of the terms of A028260 larger than 1; a(1) = 1 by convention (an empty product).

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 3, 2, 3, 1, 6, 1, 3, 3, 5, 1, 6, 1, 6, 3, 3, 1, 12, 2, 3, 3, 6, 1, 12, 1, 7, 3, 3, 3, 16, 1, 3, 3, 12, 1, 12, 1, 6, 6, 3, 1, 21, 2, 6, 3, 6, 1, 12, 3, 12, 3, 3, 1, 33, 1, 3, 6, 11, 3, 12, 1, 6, 3, 12, 1, 33, 1, 3, 6, 6, 3, 12, 1, 21, 5, 3, 1, 33, 3, 3, 3, 12, 1, 33, 3, 6, 3, 3, 3, 36, 1, 6, 6

Offset: 1

Antti Karttunen, Apr 17 2022

nonn

Number of factorizations of n^2 into factors k > 1 for which there is an even number of primes (when counted with multiplicity, A001222) in their prime factorization.

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

Cf. A000290, A001222, A028260, A038548, A046523, A065043, A353337.

Cf. also A353378.

A065043(n) = (1 - (bigomega(n)%2));
A353337(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1)&&(d<=m)&&A065043(d), s += A353337(n/d, d))); (s));
A353338(n) = A353337(n^2);

a(n) = A353337(A000290(n)).
a(n) = a(A046523(n)). [The sequence depends only on the prime signature of n].
For all n >= 1, a(n) >= A353378(n).

A378489 Intersection of A000028 and A028260.

Original entry on oeis.org

4, 9, 16, 24, 25, 40, 49, 54, 56, 60, 81, 84, 88, 90, 96, 104, 121, 126, 132, 135, 136, 140, 150, 152, 156, 160, 169, 184, 189, 198, 204, 220, 224, 228, 232, 234, 240, 248, 250, 256, 260, 276, 289, 294, 296, 297, 306, 308, 315, 328, 336, 340, 342, 344, 348, 350

Offset: 1

Paolo Xausa, Nov 28 2024, following a suggestion from Peter Munn

nonn

First differs from A066427 at n = 11, where A066427(11) = 72 is missing from this sequence.

Paolo Xausa, Table of n, a(n) for n = 1..10000

Cf. A000028, A028260, A066427, A378494.

A000028Q[k_] := k > 1 && OddQ[Count[IntegerDigits[FactorInteger[k][[All, 2]], 2], 1, 2]];
A028260Q[k_] := EvenQ[PrimeOmega[k]];
Select[Range[500], A000028Q[#] && A028260Q[#] &]

cp's OEIS Frontend

A065043 Characteristic function of the numbers with an even number of prime factors (counted with multiplicity): a(n) = 1 if n = A028260(k) for some k then 1 else 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

Views

Author

Keywords

Links

Crossrefs

Formula

Views

Author

Keywords

Links

Crossrefs

Formula

A245604 Permutation of natural numbers: a(1)=1, a(2n) = A026424(a(n)), a(2n+1) = A028260(1+a(n)).

Views

Author

Keywords

Links

Crossrefs

Formula

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A245614 Permutation of natural numbers: a(1)=1; thereafter, if n is k-th number whose greatest prime factor has an odd index [i.e., n = A244991(k)], a(n) = A026424(a(k)), otherwise, when n is k-th number whose greatest prime factor has an even index [i.e., n = A244990(1+k)], a(n) = A028260(1+a(k)).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A353337 Number of ways to write n as a product of the terms of A028260 larger than 1; a(1) = 1 by convention (an empty product).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A143692 Permutation of natural numbers: If n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = 2*k, otherwise, when n is k-th number with an even number of prime divisors [i.e., n = A028260(k)], a(n) = (2*k)-1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Formula

Extensions

A353338 Number of ways to write the square of n as a product of the terms of A028260 larger than 1; a(1) = 1 by convention (an empty product).

Views

Author

Keywords

Comments

Links

Crossrefs

A143692 Permutation of natural numbers: If n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = 2k, otherwise, when n is k-th number with an even number of prime divisors [i.e., n = A028260(k)], a(n) = (2k)-1.