OFFSET
1,1
COMMENTS
Also Heinz numbers of integer partitions that are not hooks but whose augmented differences are hooks, where the Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k), and a hook is a partition of the form (n,1,1,...,1). The enumeration of these partitions by sum is given by A325459.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
Sum_{n>=1} 1/a(n) = 2 * Sum_{p prime} 1/(p*(p-1)) - 1 = 2 * A136141 - 1 = 0.54631333809959025572... - Amiram Eldar, Sep 30 2020
EXAMPLE
The sequence of terms together with their prime indices begins:
9: {2,2}
18: {1,2,2}
25: {3,3}
27: {2,2,2}
36: {1,1,2,2}
49: {4,4}
50: {1,3,3}
54: {1,2,2,2}
72: {1,1,1,2,2}
81: {2,2,2,2}
98: {1,4,4}
100: {1,1,3,3}
108: {1,1,2,2,2}
121: {5,5}
125: {3,3,3}
144: {1,1,1,1,2,2}
162: {1,2,2,2,2}
169: {6,6}
196: {1,1,4,4}
200: {1,1,1,3,3}
MAPLE
N:= 1000: # to get terms <= N
P:= select(isprime, [seq(i, i=3..floor(sqrt(N)), 2)]):
B:= map(proc(p) local y; seq(p^y, y=2..floor(log[p](N))) end proc, P):
sort(map(proc(t) local z; seq(2^z*t, z=0..ilog2(N/t)) end proc, B)); # Robert Israel, May 03 2019
MATHEMATICA
Select[Range[1000], MatchQ[FactorInteger[2*#], {{2, _}, {_?(#>2&), _?(#>1&)}}]&]
CROSSREFS
Positions of 2's in A325355.
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 02 2019
STATUS
approved