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”).

A077655
Number of consecutive successors of n having the same number of prime factors as n (counted with multiplicity).
4
0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0
OFFSET
1,33
COMMENTS
If a(n) > 0 then a(n+1) = a(n)-1.
LINKS
EXAMPLE
33=3*11 has only two successors also with two factors: 34=2*17 and 35=5*7 (whereas 33+3=36=2*2*3*3), therefore a(33)=2.
MATHEMATICA
snpf[n_]:=Module[{f=PrimeOmega[n], k=0}, While[f==PrimeOmega[n+k], k++]; k]; Array[snpf, 110]-1 (* Harvey P. Dale, Aug 01 2021 *)
PROG
(PARI) A077655(n) = { my(k=n+1, w=bigomega(n)); while(bigomega(k)==w, k++); (k-n)-1; }; \\ Antti Karttunen, Jan 22 2020
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Nov 13 2002
STATUS
approved