Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064161
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A064161
%S A064161 12,12,20,42,66,78,102,114,138,174,186,222,246,258,282,318,354,366,402,
%T A064161 426,438,474,498,534,582,606,618,642,654,678,762,786,822,834,894,906,
%U A064161 942,978,1002,1038,1074,1086,1146,1158,1182,1194,1266,1338,1362,1374
%N A064161 Least abundant number divisible by the n-th prime number.
%F A064161 a(n) = 6*prime(n) for n>=4. - Jose Brox (tautocrona(AT)terra.es), Mar 
               24 2003
%e A064161 The first eight abundant numbers are 12, 18, 20, 24, 30, 36, 40 and 42. 
               But only the last one is divisible by 7, the fourth prime number. 
               Therefore a(4) = 42.
%t A064161 If[n==2||n==3, 4, 6]Prime[n]
%Y A064161 Sequence in context: A056627 A061074 A134324 this_sequence A040133 A092538 
               A022346
%Y A064161 Adjacent sequences: A064158 A064159 A064160 this_sequence A064162 A064163 
               A064164
%K A064161 easy,nonn
%O A064161 1,1
%A A064161 Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 15 2001

    
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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research