Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128701
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128701 Highly abundant numbers that are not products of consecutive primes with non-increasing exponents, i.e. that are not of the form n=2^{e_2} * 3^{e_3} * ...* p^{e_p}, with e_2>=e_3>=...>=e_p. +0
3
1, 3, 10, 18, 20, 42, 84, 90, 108, 168, 300, 336, 504, 540, 600, 630, 660, 1008, 1200, 1560, 1620, 1980, 2100, 2340, 2400, 3024, 3120, 3240, 3780, 3960, 4200, 4680, 5880, 6120, 6240, 7920, 8400, 8820 (list; graph; listen)
OFFSET

1,2

COMMENT

This is the subsequence of those highly abundant numbers (A002093) that have a different canonical structure to the superabundant numbers (A004394), the colossally abundant numbers (A004490), the highly composite numbers (A002182) and the superior highly composite numbers (A002201).

REFERENCES

Alaoglu, L., Erdos, P.; On Highly Composite and Similar Numbers, Transactions of the American Mathematical Society, Vol. 56, No. 3, (November 1944), pp. 448-469.

Lagarias, J. C.; An elementary problem equivalent to the Riemann hypothesis, American Mathematical Monthly 109 (2002), pp. 534-543.

LINKS

Lagarias, Jeffrey C., An Elementary Problem Equivalent to the Riemann Hypothesis.

Wikepedia, Highly Abundant Numbers.

FORMULA

The highly abundant numbers (A002093) are those values of n for which sigma(n)>sigma(m) for all m<n, where sigma(n)= A000203(n)

EXAMPLE

As 10 is the third highly abundant number that cannot be expressed as a product of consecutive primes with non-increasing exponents, then a(3)=10.

MATHEMATICA

hadata1=FoldList[Max, 1, Table[DivisorSigma[1, n], {n, 2, 10000}]]; data1=Flatten[Position[hadata1, #, 1, 1]&/@Union[hadata1]]; primefactorlist[1]={1}; primefactorlist[k_]:=First[Transpose[FactorInteger[k]]]; exponentlist[1]={1}; exponentlist[k_]:=Last[Transpose[FactorInteger[k]]]; g[k_List]:=If[MemberQ[Table[k[[i]]<= k[[i-1]], {i, 1, Length[k]}], False], False, True]; h[k_]:=If[primefactorlist[k]==(Prime[ # ]&/@Range[Length[primefactorlist[k]]]), True, False]; Select[data1, Or[ ! h[ # ], !g[exponentlist[ # ]]]&]

CROSSREFS

Cf. A002093, A004394, A000203, A004490, A002182, A002201, A128699, A128700, A128702.

Sequence in context: A017017 A003615 A043293 this_sequence A030390 A063220 A063234

Adjacent sequences: A128698 A128699 A128700 this_sequence A128702 A128703 A128704

KEYWORD

nonn

AUTHOR

Ant King (mathstutoring(AT)ntlworld.com), Mar 28 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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research