The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105069 Number of distinct prime divisors of 100^n - 3. 3

%I

%S 1,2,2,2,2,2,2,4,4,4,2,2,3,3,3,4,2,4,3,5,5,4,4,5,4,4,2,4,5,4,3,4,3,5,

%T 5,3,5,5,4,4,5,5,2,3,6,4,4,8,4,4,6,3,4,6,6,5,6,5,5,3,3,7,8,5,5,3

%N Number of distinct prime divisors of 100^n - 3.

%F a(n) = A001221(100^n-3).

%F a(n) = A105068(2*n). - _Amiram Eldar_, Jan 25 2020

%e If n = 1, then 100^1 - 3 = 97 which is prime so the first term is 1.

%p A105069 := proc(n) 100^n-3 ; numtheory[factorset](%) ; nops(%) ; end proc: # _R. J. Mathar_, Aug 24 2011

%t Table[PrimeNu[(100)^n - 3], {n, 1, 50}] (* _G. C. Greubel_, May 07 2017 *)

%Y Cf. A001221, A105068.

%K nonn,more

%O 1,2

%A _Parthasarathy Nambi_, Apr 05 2005

%E More terms from _Amiram Eldar_, Jan 25 2020

%E a(61)-a(66) from _Jinyuan Wang_, Apr 01 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 15 02:21 EDT 2021. Contains 343909 sequences. (Running on oeis4.)