|
|
|
|
#15 by Michel Marcus at Sat Jan 12 03:27:47 EST 2019
|
|
|
|
#14 by Joerg Arndt at Sat Jan 12 02:46:03 EST 2019
|
|
|
|
#13 by Jon E. Schoenfield at Fri Jan 11 20:12:06 EST 2019
|
|
|
|
#12 by Jon E. Schoenfield at Fri Jan 11 20:12:03 EST 2019
|
| NAME
|
Number of partitions of n-th composite number containing the smallest prime factor: a(n)=) = A027293(A002808(n), A056608(n)).
|
| STATUS
|
proposed
editing
|
|
|
|
#11 by Michel Marcus at Fri Jan 11 01:27:45 EST 2019
|
|
|
|
#10 by Michel Marcus at Fri Jan 11 01:27:21 EST 2019
|
| PROG
|
(PARI) lista(nn) = forcomposite(n=2, nn, print1(numbpart(n - divisors(n)[2]), ", ")); \\ Michel Marcus, Jan 11 2019
|
| STATUS
|
proposed
editing
|
|
|
Discussion
|
Fri Jan 11
| 01:27
| Michel Marcus: added pari script based on your formula
|
|
|
|
#9 by Michel Marcus at Fri Jan 11 01:17:32 EST 2019
|
|
|
Discussion
|
Fri Jan 11
| 01:17
| Michel Marcus: I wonder if formula in name should rather go to formula section ??
|
| 01:18
| Michel Marcus: but A091094 is also like this, so maybe better wait
|
| 01:20
| Charlie Neder: Why does A091094 have the formula for *this* sequence in its name?
|
| 01:25
| Michel Marcus: yes indeed ?!
|
|
|
|
#8 by Michel Marcus at Fri Jan 11 01:16:12 EST 2019
|
|
|
Discussion
|
Fri Jan 11
| 01:17
| Michel Marcus: xrefs added
|
|
|
|
#7 by Charlie Neder at Thu Jan 10 23:51:38 EST 2019
|
|
|
|
#6 by Charlie Neder at Thu Jan 10 23:51:33 EST 2019
|
|
|
|