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.

User: Kenneth Vollmar

Kenneth Vollmar's wiki page.

Kenneth Vollmar has authored 3 sequences.

A240775 The six values n in each interval [i*840, (i+1)*840), where i >= 0, for which Mordell's formulas do NOT provide a three-Egyptian-fraction solution for 4/n.

Original entry on oeis.org

1, 121, 169, 289, 361, 529
Offset: 1

Author

Kenneth Vollmar, Apr 12 2014

Keywords

Comments

Erdős and Straus conjectured that for all integers n >= 2, the rational number 4/n can be expressed as an Egyptian fraction with exactly three unit fractions -- that is, 4/n = 1/x + 1/y + 1/z where x, y and z are positive integers. The conjecture has been verified to high values of n, and Mordell has provided formulas to compute x, y and z for many n. The values of n NOT included in Mordell's formulas are those for which n modulo 840 = {an element of this sequence}. Each element is the square of a prime.

References

  • Louis J. Mordell, Diophantine Equations, Academic Press, 1967, 287-290.

A226383 Numbers for which there is at least one 3-smooth representation that is special of level k.

Original entry on oeis.org

5, 7, 11, 19, 19, 23, 29, 31, 35, 37, 47, 49, 53, 65, 65, 67, 73, 79, 85, 85, 89, 89, 97, 101, 103, 119, 121, 121, 125, 131, 133, 143, 143, 149, 151, 157, 161, 169, 175, 179, 185, 185, 197, 205, 211, 211, 215, 221, 223, 227, 233, 239, 251, 259, 259, 259, 269, 271, 275, 277, 283, 287, 287, 289, 313, 313, 319, 323, 323
Offset: 0

Author

Kenneth Vollmar, Jun 05 2013

Keywords

Comments

These numbers are of the form 3^k*2^0 + 3^{k-1}*2^{a_1} + ... + 3^1*2^{a_{k-1}} + 3^0*2^{a_k} in which every power 3^i appears, 0 <= i <= k, and where a_i satisfies a_0 = 0, a_0 < a_1 < ... < a_k.

References

  • Kenneth Vollmar, Recursive calculation of 3-smooth representations special of level k, To be submitted mid-2013.

Crossrefs

A213539 Variant of numbers for which there is at least one 3-smooth representation that is special of level k.

Original entry on oeis.org

1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 19, 20, 22, 23, 28, 29, 31, 32, 35, 37, 38, 40, 44, 46, 47, 49, 53, 56, 58, 62, 64, 65, 67, 70, 73, 74, 76, 79, 80, 85, 88, 89, 92, 94, 97, 98, 101, 103, 106, 112, 116, 119, 121, 124, 125, 128, 130, 131, 133, 134, 140, 143, 146
Offset: 0

Author

Kenneth Vollmar, Mar 03 2013

Keywords

Comments

These numbers are of the form 3^k*2^{a_0} + 3^{k-1}*2^{a_1} + ... + 3^1*2^{a_{k-1}} + 3^0*2^{a_k} in which every power 3^i appears, 0 <= i <= k, and where a_i satisfies 0 <= a_0 < a_1 < ... < a_k.
These values are those of sequence A116640 in addition to any multiple of two of elements of this sequence. - Kenneth Vollmar, Jun 05 2013

Examples

			n=19 has two 3-smooth representations that are special of level k. At k=1, 19 = 3^1*2^0 + 3^0*2^4. At k=2, 19 = 3^2*2^0 + 3^1*2^1 + 3^0*2^2.
		

References

  • Kenneth Vollmar, Recursive calculation of 3-smooth representations special of level k, To be submitted mid-2013.

Extensions

Corrected a reference to another sequence and added cross references - Joe Slater, Dec 19 2016