cp's OEIS Frontend

A065965 Numbers k that divide A039916(k).

%I A065965 #35 Aug 15 2021 15:02:10
%S A065965 1,2,3,9,18,21,43,59,74,557,8292,31898,68595,530152,599960,724192,
%T A065965 1373197,1452846,5125588,5776688
%N A065965 Numbers k that divide A039916(k).
%C A065965 Next term, if it exists, is greater than 10000000. - _Vaclav Kotesovec_, Oct 06 2014
%e A065965 A039916(9) = 141592653 = 9*15732517, so 9 is a term of this sequence.
%p A065965 for n from 1 do
%p A065965     if modp(A039916(n),n) = 0 then
%p A065965         print(n);
%p A065965     end if;
%p A065965 end do: # _R. J. Mathar_, Oct 04 2014
%t A065965 picif=RealDigits[Pi-3,10,100000][[1]]; t=0; Do[t=10*t+picif[[j]]; If[Divisible[t,j],Print[j]],{j,1,Length[picif]}] (* _Vaclav Kotesovec_, Oct 06 2014 , 7 CPU hours with 10000000 *)
%o A065965 (PARI) a065965(m,n) = {local(pr,pi,k); pr=default(realprecision,1); default(realprecision,n); p=Pi-3; for(k=m,n, if(truncate(p*10^k)%k==0,print1(k,","))); default(realprecision,pr); }
%o A065965 a065965(1,2^15)
%Y A065965 Cf. A039916.
%K A065965 base,nonn,more
%O A065965 1,2
%A A065965 _Jason Earls_, Dec 08 2001
%E A065965 a(12) from _Klaus Brockhaus_, Dec 10 2001
%E A065965 a(13)-a(16) from _Jeff Heleen_, Sep 28 2014
%E A065965 a(17)-a(20) from _Vaclav Kotesovec_, Oct 06 2014