A172398 -id:A172398 - cp's OEIS frontend

A280634 Number of partitions of 2n into two refactorable parts.

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

Offset: 1

Wesley Ivan Hurt, Jan 06 2017

			a(5) = 2; There are two partitions of 2*5 = 10 into two refactorable parts: (1,9) and (2,8).

Eric Weisstein's World of Mathematics, Refactorable Number
Index entries for sequences related to partitions

Cf. A000005, A033950, A172398, A280226.

with(numtheory): A280634:=n->add((1-signum((i mod tau(i))))*(1-signum((2*n-i) mod tau(2*n-i))), i=1..n): seq(A280634(n), n=1..150);

Table[Sum[(1 - Sign[Mod[i, DivisorSigma[0, i]]]) (1 - Sign[Mod[#, DivisorSigma[0, #]]] &[2 n - i]), {i, n}], {n, 90}] (* Michael De Vlieger, Jan 07 2017 *)

a(n) = Sum_{i=1..n} (1-sign(i mod d(i))) * (1-sign((2n-i) mod d(2n-i))) where d(n) is the number of divisors of n.

A337853 a(n) is the number of partitions of n as the sum of two Niven numbers.

Original entry on oeis.org

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

Offset: 0

Marius A. Burtea, Sep 26 2020

a(n) >= 1 for n >= 2 ?.

For n <= 200000, a(n) = 1 only for n = 2, 3, 299, (2 = 1 + 1, 3 = 1 + 2, 299 = 1 + 288) and a(n) = 2 only for n in {4, 5, 35, 59, 79, 95, 97, 149, 169, 179, 389}.

			0 and 1 cannot be decomposed as the sum of two Niven numbers, so a(0) = a(1) = 0.
4 = 1 + 3 = 2 + 2 and 1, 2, 3 are in A005349, so a(4) = 2.
15 = 3 + 12 = 5 + 10 = 6 + 9 = 7 + 8 and 3, 5, 6, 7, 8, 9, 10, 12 are in A005349, so a(15) = 4.

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Cf. A005349, A116357, A172151, A172398, A180149, A280829, A319468, A302479, A319395, A337854.

niven:=func; [#RestrictedPartitions(n,2,{k: k in [1..n-1] | niven(k)}): n in [0..100]];

m = 100; nivens = Select[Range[m], Divisible[#, Plus @@ IntegerDigits[#]] &]; a[n_] := Length[IntegerPartitions[n, {2}, nivens]]; Array[a, m, 0] (* Amiram Eldar, Sep 27 2020 *)

A281663 Refactorable numbers that are not the sum of two refactorable numbers.

Original entry on oeis.org

1, 8, 12, 40, 56, 225, 441

Offset: 1

Altug Alkan, Jan 26 2017

Is this sequence finite?

			40 is a term because 40 is a refactorable number and there is no partition of 40 into two refactorable parts.

S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999.
Joshua Zelinsky, Tau Numbers: A Partial Proof of a Conjecture and Other Results , Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.8

Cf. A033950, A172398, A280634.

isrefac(n) = (n%numdiv(n))==0;
isok(n) = isrefac(n) && (sum(k=1, n\2, isrefac(k) && isrefac(n-k)) == 0); \\ Michel Marcus, Jan 26 2017

A282519 Refactorable numbers that are the sum of two refactorable numbers in exactly one way.

Original entry on oeis.org

2, 9, 18, 24, 60, 88, 625, 1089, 2601, 1500625

Offset: 1

Altug Alkan, Feb 17 2017

Sequence is a result of investigation on the marked region in graph of A172398(A033950(n)) that is in Links section. Also there are other sequences that marked region has.

			Refactorable number 1500625 is a term because 1500625 is the sum of two refactorable numbers in exactly one way, that is, 1500625 = 5^4 * 7^4 = 3^2 * 131^2 + 2^7 * 13 * 809.

Altug Alkan, Illustration of A172398(A033950(n))
S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999.
Joshua Zelinsky, Tau Numbers: A Partial Proof of a Conjecture and Other Results , Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.8

Cf. A033950, A172398, A280634, A281663.

a(10) from Giovanni Resta, Feb 17 2017

cp's OEIS Frontend

A280634 Number of partitions of 2n into two refactorable parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A337853 a(n) is the number of partitions of n as the sum of two Niven numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

A281663 Refactorable numbers that are not the sum of two refactorable numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A282519 Refactorable numbers that are the sum of two refactorable numbers in exactly one way.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions