Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083506
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083506 n-th row of the following triangle contains all distinct numbers that can be obtained as the product of two distinct numbers chosen from 1 to n. (n>1). Sequence contains the triangle read by rows. +0
1
2, 2, 3, 6, 2, 3, 4, 6, 8, 12, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 20, 24, 30, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 18, 20, 21, 24, 28, 30, 35, 42, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 18, 20, 21, 24, 28, 30, 32, 35, 40, 42, 48, 56, 2, 3, 4, 5, 6, 7, 8, 9 (list; graph; listen)
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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research