login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027419 Number of distinct products i*j with 0 <= i, j <= n-th prime. 1

%I #15 Oct 14 2023 00:03:51

%S 4,7,15,26,54,73,115,143,200,297,340,461,559,619,731,904,1098,1178,

%T 1393,1556,1652,1912,2103,2391,2785,3008,3150,3392,3535,3789,4647,

%U 4941,5363,5555,6299,6495,6963,7481,7864,8403,8968,9196,10115,10364,10805,11068,12271

%N Number of distinct products i*j with 0 <= i, j <= n-th prime.

%p seq(A027384(ithprime(n)),n=1..40) ; # _R. J. Mathar_, Jun 09 2016

%o (Python)

%o from sympy import prime

%o def A027419(n): return len({i*j for i in range(1,prime(n)+1) for j in range(1,i+1)})+1 # _Chai Wah Wu_, Oct 13 2023

%Y Cf. A027384.

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_

%E More terms from _Olivier GĂ©rard_, Nov 15 1997

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)