login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A375160
Square array T(n, k), n >= 2 and k >= 1, read by antidiagonals in ascending order, give the smallest number that starts a sequence of exactly k consecutive numbers each having exactly n prime factors (counted with multiplicity), or -1 if no such number exists.
0
4, 8, 9, 16, 27, 33, 32, 135, 170, -1, 64, 944, 1274, 603, -1, 128, 5264, 15470, 4023, 602, -1, 256, 29888, 33614, 57967, 12122, 2522, -1, 512, 50624, 3145310, 8706123, 632148, 204323, 211673, -1
OFFSET
2,1
COMMENTS
All positive terms are composite.
EXAMPLE
T(2,3) = 33 = 3*11, because both 34 and 35 have the same number of prime factors. Thus, 33 is the starting number of a run of 3 numbers that each have 2 prime factors (counted with multiplicity). No lesser number has this property, so T(2,3) = 33.
Table begins (upper left corner = T(2,1)):
4 9 33 -1 ...
8 27 170 603 ...
16 135 1274 4023 ...
32 944 15470 57967 ...
... ... ... ... ...
CROSSREFS
Cf. Numbers m through m+k have the same number of prime divisors (with multiplicity): A045920 (k=1), A045939 (k=2), A045940 (k=3), A045941 (k=4), A045942 (k=5), A123103 (k=6), A123201 (k=7), A358017 (k=8), A358018 (k=9), A358019 (k=10).
Sequence in context: A355580 A272758 A227645 * A285438 A089042 A340093
KEYWORD
sign,tabl,more
AUTHOR
Jean-Marc Rebert, Aug 09 2024
STATUS
approved