This site is supported by donations to The OEIS Foundation.

Template:Sequence of the Day for November 11

From OeisWiki
Jump to: navigation, search

Intended for: November 11, 2012

Timetable

  • First draft entered by Alonso del Arte on November 10, 2010
  • Draft nominated for use each Veterans' Day by Alonso del Arte on November 9, 2011
  • Draft to be reviewed by September 11, 2012
  • Draft to be approved by October 11, 2012

Yesterday's SOTD * Tomorrow's SOTD

The line below marks the end of the <noinclude> ... </noinclude> section.



A053664: Smallest number
m
such that
m   ≡   i  (mod pi )
for
1   ≤   i   ≤   n
.
{ 1, 5, 23, 53, 1523, 29243, 299513, ... }

This is a sequence that was suggested to Joe Crump by the Chinese remainder theorem. I’ve heard theories that the Chinese proved that theorem because it had a practical application as a means to quickly and efficiently count soldiers.

On this Veterans’ Day, we salute all those who have served in the Army, Air Force, Navy and Marine Corps.