cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-20 of 30 results. Next

A238795 The unique set of eleven distinct positive odd numbers up to 105 the sum of whose reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 11, 33, 35, 45, 55, 77, 105
Offset: 1

Views

Author

Arkadiusz Wesolowski, Mar 05 2014

Keywords

Comments

For any set of distinct numbers whose reciprocals sum to 1, the largest must be neither a prime nor a prime power.
For sets of 11 distinct positive odd numbers, relaxing the a(11) <= 105 constraint allows a second solution at 115 (3, 5, 7, 9, 15, 21, 23, 45, 69, 105, 115), a third at 117 (3, 5, 7, 9, 13, 21, 35, 39, 63, 105, 117), 3 more at 135, 2 more at 143, and 2 more at 165. - Jon E. Schoenfield, Mar 07 2014

Examples

			1/3 + 1/5 + 1/7 + 1/9 + 1/11 + 1/33 + 1/35 + 1/45 + 1/55 + 1/77 + 1/105 = 1.
		

Crossrefs

A270599 Number of ways to express 1 as the sum of unit fractions with odd denominators such that the sum of those denominators is n.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0
Offset: 1

Views

Author

Seiichi Manyama, Mar 26 2016

Keywords

Comments

Number of partitions of n into such odd parts that the sum of their reciprocals is one. - Antti Karttunen, Jul 23 2018
It would be nice to know whether nonzero values may occur only on n of the form 8k+1.

Examples

			1 = 1/3 + 1/3 + 1/3, the sum of denominators is 9, this is the only expression of 1 as unit fractions with odd denominators that sum to 9, so a(9)=1.
1 = 1/15 + 1/5 + 1/5 + 1/5 + 1/3 = 1/9 + 1/9 + 1/9 + 1/3 + 1/3 are the only solutions with odd denominators that sum to 33, thus a(33) = 2. - _Antti Karttunen_, Jul 24 2018
		

Crossrefs

Programs

  • Mathematica
    Array[Count[IntegerPartitions[#, All, Range[1, #, 2]], ?(Total[1/#] == 1 &)] &, 70] (* _Michael De Vlieger, Jul 26 2018 *)
  • PARI
    A270599(n,maxfrom=n,fracsum=0) = if(!n,(1==fracsum),my(s=0, tfs, k=(maxfrom-!(maxfrom%2))); while(k >= 1, tfs = fracsum + (1/k); if(tfs > 1, return(s), s += A270599(n-k,min(k,n-k),tfs)); k -= 2); (s)); \\ Antti Karttunen, Jul 23 2018
    
  • PARI
    \\ More verbose version for computing values of a(n) for large n:
    A270599(n) = if(!(n%2), 0, my(s=0); forstep(k = n, 1, -2, print("A270599(", n, ") at toplevel, k=", k, " s=", s); s += A270599aux(n-k, min(k, n-k), 1/k)); (s));
    A270599aux(n,maxfrom,fracsum) = if(!n,(1==fracsum),my(s=0, tfs, k=(maxfrom-!(maxfrom%2))); while(k >= 1, tfs = fracsum + (1/k); if(tfs > 1, return(s), s += A270599aux(n-k,min(k,n-k),tfs)); k -= 2); (s)); \\ Antti Karttunen, Jul 24 2018
  • Ruby
    def f(n)
      n - 1 + n % 2
    end
    def partition(n, min, max)
      return [[]] if n == 0
      [f(max), f(n)].min.step(min, -2).flat_map{|i| partition(n - i, min, i).map{|rest| [i, *rest]}}
    end
    def A270599(n)
      ary = [1]
      (2..n).each{|m|
        cnt = 0
        partition(m, 2, m).each{|ary|
          cnt += 1 if ary.inject(0){|s, i| s + 1 / i.to_r} == 1
        }
        ary << cnt
      }
      ary
    end
    

Formula

a(2*k) = 0. - David A. Corneth, Jul 24 2018

Extensions

Name corrected by Antti Karttunen, Jul 23 2018 at the suggestion of David A. Corneth

A316113 a(n) is the least sum of a tuple containing n as an element where the denominator of the sum of reciprocals isn't divisible by any of the prime factors of n.

Original entry on oeis.org

1, 4, 9, 10, 20, 11, 35, 22, 30, 22, 66, 22, 91, 37, 28, 46, 119, 32, 152, 31, 41, 68, 184, 37, 110, 106, 93, 53, 261, 51, 279, 94, 69, 121, 59, 60, 370, 192, 97, 64, 451, 54, 430, 94, 65, 186, 517, 74, 259, 112, 122, 97, 583, 95, 92, 92, 158, 263, 767, 77, 671
Offset: 1

Views

Author

David A. Corneth, Jul 22 2018

Keywords

Examples

			a(12) = 22 because the tuple [3, 3, 4, 12] has the sum of reciprocals 1/3 + 1/3 + 1/4 + 1/12 = 1 of which the denominator is 1 and has no common prime factors with n = 12.
a(25) = 110 because the tuple [5, 5, 25, 25, 50] has the sum of reciprocals 1/5 + 1/5 + 1/25 + 1/25 + 1/50 = 1/2 of which the denominator is 2 and has no common prime factors with n = 25.
		

Crossrefs

Extensions

More terms from Ray Chandler, Oct 02 2018

A211119 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 35, 63, 75, 1575
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.

A211120 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 35, 45, 175, 525
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.

A211121 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 27, 75, 135, 1575
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.

A211122 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 35, 45, 225, 315
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.

A211123 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 35, 63, 105, 225
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.

A211124 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 35, 45, 147, 1225
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.

A211125 One of 17 possible sets of eleven numbers of the form 3^alpha 5^beta 7^gamma whose sum of reciprocals is 1.

Original entry on oeis.org

3, 5, 7, 9, 15, 21, 25, 35, 45, 135, 4725
Offset: 1

Views

Author

N. J. A. Sloane, Apr 02 2012

Keywords

Crossrefs

The 17 solutions are given in A201643, A211118-A211132, A211134.
Previous Showing 11-20 of 30 results. Next