Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027384
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A027384
%S A027384 1,2,4,7,10,15,19,26,31,37,43,54,60,73,81,90,98,115,124,143,153,165,177,
%T A027384 200,210,226,240,255,268,297,309,340,355,373,391,411,424,461,481,502,518,
%U A027384 559,576,619,639,660,684,731,748,779,801,828,851,904,926,957,979,1009,
               1039
%N A027384 Number of distinct products ij with 0 <= i, j <= n.
%H A027384 T. D. Noe, <a href="b027384.txt">Table of n, a(n) for n=0..1000</a>
%p A027384 L := {}; for i from 0 to n do for j from i to n do L := L union {i*j}; 
               od: od: nops(L);
%Y A027384 Equals A027424 + 1, n>0.
%Y A027384 Sequence in context: A079963 A056750 A095116 this_sequence A022939 A036702 
               A007983
%Y A027384 Adjacent sequences: A027381 A027382 A027383 this_sequence A027385 A027386 
               A027387
%K A027384 nonn,easy
%O A027384 0,2
%A A027384 Fred Schwab (fschwab(AT)nrao.edu)

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research