Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027428
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027428 Number of distinct products ij with 1 <= i < j <= n. +0
5
0, 1, 3, 6, 10, 13, 19, 24, 31, 36, 46, 51, 63, 70, 78, 87, 103, 111, 129, 139, 150, 161, 183, 192, 210, 223, 239, 252, 280, 291, 321, 337, 354, 371, 390, 403, 439, 458, 478, 493, 533, 549, 591, 611, 631, 654, 700, 717, 752, 774, 800, 823, 875 (list; graph; listen)
OFFSET

1,3

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

a(n)=A027427(n)-1. - T. D. Noe, Jan 16 2007

MAPLE

f:=proc(n) local i, j, t1, t2; t1:={}; for i from 1 to n-1 do for j from i+1 to n do t1:={op(t1), i*j}; od: od: t1:=convert(t1, list); nops(t1); end;

CROSSREFS

Cf. A027424

Sequence in context: A047280 A049880 A128039 this_sequence A136850 A079248 A083505

Adjacent sequences: A027425 A027426 A027427 this_sequence A027429 A027430 A027431

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research