|
%I #11 Mar 19 2018 10:06:55
%S 2,2,2,3,2,2,2,3,2,3,2,4,3,2,2,3,2,5,4,3,2,3,2,3,2,3,2,3,2,2,14,5,4,3,
%T 2,5,4,3,2,3,2,5,4,3,2,3,2,5,4,3,2,6,8,5,4,3,2,3,2,4,3,2,4,3,2,5,4,3,
%U 2,3,2,7,8,5,4,3,2,3,2,3,2,6,10,5,4,3,2,6,6,6,15,5,4,3,2,5,4,3,2,3,2,5,4
%N Smallest k such that omega(n+k) = omega(k).
%H Harry J. Smith, <a href="/A065569/b065569.txt">Table of n, a(n) for n=1..1000</a>
%o (PARI): ome(m)= {local(k,n); for(k=1,m,n=1; while(omega(n)!=omega(n+k), n++); print1(n,","))} ome(200)
%o (PARI) { for (n=1, 1000, k=1; while(omega(n + k) != omega(k), k++); write("b065569.txt", n, " ", k) ) } \\ _Harry J. Smith_, Oct 23 2009
%Y Cf. A001221, A065925.
%K nonn
%O 1,1
%A _Jason Earls_, Nov 30 2001
|
