cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A385375 Numbers k that can't be partitioned into tau(k) distinct parts.

Original entry on oeis.org

2, 4, 6, 8, 12, 18, 20, 24, 30, 36, 48, 60, 72, 120
Offset: 1

Views

Author

Felix Huber, Jul 11 2025

Keywords

Comments

Numbers k for which k < A000217(tau(k)).
To partition k into tau(k) distinct parts, k >= tau(k)*(tau(k) + 1)/2. According to A374793, k > tau(k)^2 > tau(k)*(tau(k) + 1)/2 for k > 1260. The sequence is therefore finite and contains 14 terms.

Examples

			6 is a term because there is no partition of 6 into tau(6) = 4 distinct parts.
		

Crossrefs

Programs

  • Maple
    with(NumberTheory):
    A385375:=proc(K)
        local k,l;
        l:=[];
        for k from 1 to K do
            if tau(k)*(tau(k)+1)/2>k then
                l:=[op(l),k];
            end if;
        end do;
        return op(l);
    end proc:
    A385375(1260);
  • Mathematica
    s={};Do[t=DivisorSigma[0,k];If[NoneTrue[Length/@Union/@IntegerPartitions[k,{t}],#==t&],AppendTo[s,k]],{k,72}];s (* James C. McMahon, Jul 24 2025 *)
Showing 1-1 of 1 results.