Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100832
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100832 Amenable numbers: n such that there exists a multiset of integers (s(1), ..., s(n)) whose size, sum and product are all n. +0
1
1, 5, 8, 9, 12, 13, 16, 17, 20, 21, 24, 25, 28, 29, 32, 33, 36, 37, 40, 41, 44, 45, 48, 49, 52, 53, 56, 57, 60, 61, 64, 65, 68, 69, 72, 73, 76, 77, 80, 81, 84, 85, 88, 89, 92, 93, 96, 97, 100, 101, 104, 105, 108, 109, 112, 113, 116, 117, 120, 121, 124, 125, 128, 129, 132 (list; graph; listen)
OFFSET

1,2

COMMENT

Essentially the same as A042948.

The set {s(i)} is closed under multiplication. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jan 21 2005

REFERENCES

O. P. Lossers, Solution to problem 10454, "Amenable Numbers", Amer. Math. Monthly Vol. 105 No. 4 April 1998 MAA Washington DC.

LINKS

Eric Weisstein's World of Mathematics, Amenable Number

Wikipedia, Amenable number

FORMULA

Consists of the numbers n == 0 or 1 (mod 4), excluding n=4.

EXAMPLE

5 and 8, for instance, are in the sequence because we have 5=1-1+1-1+5=1*(-1)*1*(-1)*5 and 8=1-1+1-1+1+1+2+4=1*(-1)*1*(-1)*1*1*2*4.

CROSSREFS

Cf. A014601.

Sequence in context: A165991 A101079 A066812 this_sequence A034812 A066467 A072833

Adjacent sequences: A100829 A100830 A100831 this_sequence A100833 A100834 A100835

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Jan 07 2005

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net), Jan 24 2005

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research