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!)
A027421 Triangle T(n,k) = number of distinct products ij with k<=i,j<=n, for 0<=k<=n. 2

%I #5 Jan 27 2014 09:13:04

%S 1,2,1,4,3,1,7,6,3,1,10,9,6,3,1,15,14,10,6,3,1,19,18,14,10,6,3,1,26,

%T 25,20,15,10,6,3,1,31,30,25,20,15,10,6,3,1,37,36,31,26,20,15,10,6,3,1,

%U 43,42,37,32,26,21,15,10,6,3,1,54,53,47,41,34,28,21,15,10,6,3,1

%N Triangle T(n,k) = number of distinct products ij with k<=i,j<=n, for 0<=k<=n.

%e 1; 2,1; 4,3,1; 7,6,3,1; 10,9,6,3,1; ...

%Y Cf. A027384, A027422.

%K tabl,nonn,easy

%O 0,2

%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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)