This site is supported by donations to The OEIS Foundation.

# User:M. F. Hasler/Proposal for MainPage

 Welcome to the OEIS wiki, the wiki complement to the On-Line Encyclopedia of Integer Sequences. 179,162 articles.

#### Editor's Guide

• A239797 Decimal expansion of ${\displaystyle {\frac {\sqrt {3}}{\sqrt[{3}]{4}}}}$.
• A238271 Decimal expansion of ${\displaystyle \sum _{n=1}^{\infty }{\frac {\mu (n)}{3^{n}}}}$.
• A237042 UPC check digits.
• A236603 Lowest canonical Gray cycles of length ${\displaystyle 2n}$.
• A235365 Smallest odd prime factor of ${\displaystyle 3^{n}+1}$.
• A234522 Decimal expansion of ${\displaystyle {\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 ${\displaystyle n}$ with its UPC check digit.
• A230624 Numbers ${\displaystyle n}$ with property that for every base ${\displaystyle b\geq 2}$, there is a number ${\displaystyle m}$ such that ${\displaystyle m+s(m)=n}$, where ${\displaystyle s(m)}$ is the sum of digits in the base ${\displaystyle b}$ expansion of ${\displaystyle m}$.

## Sequence of the Day for December 11

A188859: Decimal expansion of
 2  −  log 4
.
0.613705638880109...
This is the limit (as
 n
increases without bound) of the probability that
 n mod m
is less than
 m 2
, with
 m
chosen uniformly at random from
 {1, ..., n}
. (As usual,
 0   ≤   n mod m < m
.)

#### OEIS lookup

<form action="http://oeis.org/search" method="get"><input type="submit" value="Search" name="go"><input maxLength="1024" size="55" dir="LTR" name="q" value="" title="Search Query"> <a href="http://oeis.org/hints.html">(hints)</a></form>

(This is a trial template:OEIS lookup -- as you can see, it does not work. Request for a convenient wiki extension (such as http://www.mediawiki.org/wiki/Extension:InputBox) is under way...

#### On this day...

• December 11, 1870 George James Lidstone in born in London.

## Sequences in the News

• Feb 01 2018 Alphabet announced a $8,589,869,056 =$A000396(6) stock buyback.
• Jan 03 2018 Largest known term of A000043 announced: 77232917.
• Nov 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.
• Sep 14 2016 Tom Greer discovers the twin primes 2996863034895 × 2 1290000 ± 1 using PrimeGrid, TwinGen and LLR.
• Jan 19 2016 Largest known term of A000043 announced: 74207281, also discovered by Curtis Cooper.
• Mar 02 2014 Fredrik Johansson announces a computation of the partition number p(10 20) ≈ 1.8381765 × 10 11140086259, the largest known term of A000041.
• Dec 06 2013 Microsoft launches a challenge to find large non-Mersenne primes, A138837.

#### Featured picture (Check back later for today's.)

Template:POTD protected/2018-12-10 (Fill in some other useful content here; look for older revision of this page for other color codes.)

## Related web sites

In case you would not find here what you are looking for (after a thorough search), you might want to visit some related web sites: