Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077552
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077552 Consider the following triangle in which the n-th row contains n distinct numbers whose product is the smallest and has the least possible number of divisors. 1 is a member of only the first row. Sequence contains the final term of the rows (the leading diagonal). +0
4
1, 3, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648 (list; graph; listen)
OFFSET

0,2

FORMULA

For n>2, a(n)=2^n. - Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 21 2003

Row sums of triangle A132309. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 18 2007

EXAMPLE

Triangle begins

1

2 3

2 4 8

2 4 8 16

2 4 8 16 32

CROSSREFS

Cf. A132309.

Sequence in context: A081661 A005103 A001978 this_sequence A024623 A027291 A048952

Adjacent sequences: A077549 A077550 A077551 this_sequence A077553 A077554 A077555

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 10 2002

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 21 2003

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 21 21:21 EST 2009. Contains 167310 sequences.


AT&T Labs Research