Taxman sequence: define T(S) by max{x+T(S \ {c : c|x})}, where the max is over all x in S for which S also contains a proper divisor of x; if no such x exists, T(S)=0; set T(n)=T({1,...,n}).
A019312
Taxman sequence: define T(S) by max{x+T(S \ {c : c|x})}, where the max is over all x in S for which S also contains a proper divisor of x; if no such x exists, T(S)=0; set T(n)=T({1,...,n}).
Terms
- a(0) =0a(1) =2a(2) =3a(3) =7a(4) =9a(5) =15a(6) =17a(7) =21a(8) =30a(9) =40a(10) =44a(11) =50a(12) =52a(13) =66a(14) =81a(15) =89a(16) =93a(17) =111a(18) =113a(19) =124a(20) =144a(21) =166a(22) =170a(23) =182a(24) =198a(25) =224a(26) =251a(27) =279a(28) =285a(29) =301
External references
- oeis: A019312