Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131655
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131655 Maximal number of different numbers that can be formed from n numbers using addition, subtraction, multiplication and division, when each number is used no more than once in a given expression. +0
2
1, 8, 89, 1482 (list; graph; listen)
OFFSET

1,2

COMMENT

See triangle A133568: Each row gives the least sequence of n positive integers such that a(n) distinct numbers are generated by these operations. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Sep 16 2007

EXAMPLE

a(2)=8 : from two variables x and y we obtain the eight functions x, y, x+y, x*y, x-y, y-x, x/y and y/x

CROSSREFS

Cf. A133568.

Adjacent sequences: A131652 A131653 A131654 this_sequence A131656 A131657 A131658

Sequence in context: A061000 A072352 A099100 this_sequence A105718 A045732 A077192

KEYWORD

nonn

AUTHOR

Daniel Rainjonneau (d.rainjonneau(AT)wanadoo.fr), Sep 11 2007

EXTENSIONS

Definition corrected by Rick L. Shepherd (rshepherd2(AT)hotmail.com), Sep 16 2007

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research