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.

A258640 Whole number sieve of square root of 2.

Original entry on oeis.org

1, 3, 4, 8, 9, 80, 9, 69, 0, 7, 7, 8, 2, 0, 5, 3, 7, 0, 9, 0, 8, 37, 4, 0, 55, 75, 99, 50, 7, 0, 5, 97, 27, 9, 1, 9, 8, 55, 9, 48, 87, 2, 8, 36, 95, 79, 25, 3, 88, 20, 5, 47, 8, 6, 37, 70, 54, 60, 8, 8, 60, 4, 50, 0, 5, 2, 6, 0, 7, 130, 18, 86, 2, 34
Offset: 1

Views

Author

Manfred Scheucher, Jun 06 2015

Keywords

Examples

			Find the first occurrence of 0 (the first whole number) in the digits of sqrt(2) (only 35 digits in this illustration):
14142135623730950488016887242096980..., and replace it with a space:
1414213562373 950488016887242096980...  Repeat the process with the next whole number, 1:
414213562373 950488016887242096980...  Then 2:
414 13562373 950488016887242096980...  Then 3:
414 1 562373 950488016887242096980...  Then 4,5,6,7, etc., until the first occurrence of every counting number is eliminated from the digits of sqrt(2).
     1      3    4     8      9    ...  Then consolidate gaps between the remaining digits into a single comma:
1,3,4,8,9,80,9,69,0,7,7,8,2,0,5,3, ...  to produce the first terms in the whole number sieve of sqrt(2).
		

Crossrefs