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.

A088143 Find the shortest prefix of Pi-3 = .141592653589793238462643383279502.. which is divisible by n and divide by n.

Original entry on oeis.org

1, 7, 47, 35398, 283, 23598775598298873, 2, 17699, 15732517, 1415926535897932384626433832795, 12872, 117993877991494365385536152732919, 1089174258383, 1, 943951, 88495408493620774, 8328979622929, 7866258532766291, 7452244925778591498
Offset: 1

Views

Author

N. J. A. Sloane, Nov 03 2003

Keywords

Comments

a(152) has 1218 digits, so is too large for a b-file. - Robert Israel, Sep 19 2019

Examples

			1/1 = 1, 14/2 = 7, 141/3 = 47, 141592/4 = 35398, 1415/5 = 283,...
		

Crossrefs

Cf. A000796.

Programs

  • Maple
    F:= floor((Pi-3)*10^10000):
    Prefs:= [seq(floor(F/10^(10000-i)),i=1..10000)]:
    f:= proc(n) local i;
    for i from 1 to nops(Prefs) do if Prefs[i] mod n = 0 then return Prefs[i]/n fi od:
    FAIL
    end proc:
    map(f, [$1..151]); # Robert Israel, Sep 19 2019

Extensions

Corrected and extended by Ray Chandler and Vladeta Jovovic, Nov 06 2003
Name corrected by Robert Israel, Sep 19 2019