login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275121 a(n) is the smallest multiple of n that is a practical number. 1
1, 2, 6, 4, 20, 6, 28, 8, 18, 20, 66, 12, 78, 28, 30, 16, 204, 18, 228, 20, 42, 66, 276, 24, 100, 78, 54, 28, 348, 30, 496, 32, 66, 204, 140, 36, 666, 228, 78, 40, 820, 42, 860, 88, 90, 276, 1128, 48, 196, 100, 204, 104, 1272, 54, 220, 56, 228, 348, 1416, 60 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A rational in (0,1) as a fraction in lowest terms with denominator n, if expressed with denominator a(n) will have a practical-number denominator and can be written as an Egyptian fraction.
Note that a(n) exists for each n; a trivial upper bound is n * gpf(n)# = n * A034386(A006530(n)). - Charles R Greathouse IV, Jul 25 2016
LINKS
FORMULA
a(n) = n * A210445(n).
EXAMPLE
For example a(5)=20, indicating that a fraction with denominator 5 can be rewritten as a fraction with denominator 20, which is a practical number. Thus a fraction such as 4/5 can be written as 16/20. The new numerator 16 can be written as the sum of distinct divisors of 20 (16=10+5+1) because 20 is a practical number. The fractions 10/20, 5/20, and 1/20 are each a reciprocal: 1/2, 1/4, and 1/20. Thus 4/5 can be written as the sum of distinct reciprocals (Egyptian fraction expansion) as 4/5 = 1/2 + 1/4 + 1/20.
PROG
(PARI) /* First declare the function is_a005153(n) as in A005153 */
a(n) = my(k=1); while(!is_a005153(k*n), k++); k*n \\ Felix Fröhlich, Jul 18 2016
CROSSREFS
Cf. A005153 (practical numbers), A210445.
Sequence in context: A063427 A066092 A100695 * A174824 A009262 A127699
KEYWORD
nonn
AUTHOR
Lee A. Newberg, Jul 18 2016
EXTENSIONS
More terms from Felix Fröhlich, Jul 18 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 16:22 EDT 2024. Contains 371780 sequences. (Running on oeis4.)