This site is supported by donations to The OEIS Foundation.

User:Alonso del Arte

From OeisWiki

Jump to: navigation, search

Here is one of my projects: IMSLP Orchestra to do world premiere recording of Symphony by Franz Asplmayr.

I graduated from Wayne State University with a bachelor's degree in Film Studies in 2008. In 2004, I wrote for WSU's student newspaper, The South End, an article on the celebration for the 100,000th sequence to be added to the OEIS, A100000.

Sequence of the Day for October 21

Some Mordell curves in Grapherfor Mac OS X.
A081119: Number of integral solutions to Mordell's equation
y 2 = x 3 + n
{ 5, 2, 2, 2, 2, 0, 0, 7, 10, 2, ... }
Mordell's equation has a finite number of integral solutions for all nonzero
. For example, for
n = 1
, there are five solutions:
(2, –3), (0, –1), (–1, 0), (0, 1)
(2, 3)
. For
n = 2
, there are just two solutions each and none for
n = 6

Selected Recent Additions

  • A239797 Decimal expansion of \frac{\sqrt{3}}{\sqrt[3]{4}}.
  • A238271 Decimal expansion of \sum_{n =1}^\infty \frac{\mu(n)}{3^n}.
  • A237042 UPC check digits.
  • A236603 Lowest canonical Gray cycles of length 2n.
  • A235365 Smallest odd prime factor of 3n + 1.
  • A234522 Decimal expansion of \sqrt[4]{7} - \sqrt[4]{5}.
  • A233748 Number of graphs on n vertices with edges colored with at most four interchangeable colors under the symmetries of the full edge permutation group.
  • A232499 Number of unit squares, aligned with a Cartesian grid, completely within the first quadrant of a circle centered at the origin ordered by increasing radius.
  • A231963 Concatenate n with its UPC check digit.
  • A230624 Numbers n with property that for every base b \geq 2, there is a number m such that m + s(m) = n, where s(m) is the sum of digits in the base b expansion of m.

Sequences in the News

  • November 18, 2016 PrimeGrid proves that 10223 is not a Sierpinski number, since 10223 × 2 31172165 + 1 is prime. So no changes to A076336 for now.
  • September 14, 2016 Tom Greer discovers the twin primes 2996863034895 × 2 1290000 ± 1 using PrimeGrid, TwinGen and LLR.
  • January 19, 2016 Largest known term of A000043 announced: 274207281, also discovered by Curtis Cooper.
  • March 2, 2014 Fredrik Johansson announces a computation of the partition number \scriptstyle p(10^{20}) \approx 1.8381765\cdot10^{11140086259}, the largest known term of A000041.
  • December 6, 2013 Microsoft launches a challenge to find large non-Mersenne primes, A138837.
  • May 13, 2013 H. A. Helfgott submits a proof of the weak Goldbach conjecture, i.e. for odd numbers as sums of three primes: A007963 has no more zeroes.
  • January 25, 2013 Curtis Cooper discovers a new member of A000043, 57885161. Its index is not known but is at least 48.
  • January 13, 2013 The winners of the contest for new sequences in the OEIS at JMM 2013 were announced: A187824, A187771, and A187761.

Personal tools