OFFSET
1,1
COMMENTS
These are numbers n for which the greedy algorithm A276380(n) produces a partition of n with more than A237442(n) terms that are all unique and in A003586.
REFERENCES
V. Dimitrov, G. Jullien, R. Muscedere, Multiple Number Base System Theory and Applications, 2nd ed., CRC Press, 2012, pp. 35-39.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..3000
EXAMPLE
MATHEMATICA
f[n_] := Length@ DeleteCases[Append[Abs@ Differences@ #, Last@ #], k_ /; k == 0] &@ NestWhileList[# - SelectFirst[# - Range[0, # - 1], Module[{a = #, b = 6}, While[And[a != 1, ! CoprimeQ[a, b]], b = GCD[a, b]; a = a/b]; a == 1] &] &, n, # > 1 &]; g[n_] := Block[{p = Select[Range@ n, FactorInteger[#][[-1, 1]] < 4 &], k = 1}, While[{} == Quiet@ IntegerPartitions[n, {k}, p, 1], k++]; k]; Select[Range@ 500, f@ # != g@ # &] (* function g after Giovanni Resta at A237442 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael De Vlieger, Sep 27 2016
STATUS
approved