Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #29 Dec 12 2024 15:38:08
%S 1,14,141,141592,1415,141592653589793238,14,141592,141592653,
%T 14159265358979323846264338327950,141592,
%U 1415926535897932384626433832795028,14159265358979,14,14159265,1415926535897932384,141592653589793,141592653589793238,141592653589793238462
%N The first subsequence starting at the first digit after the decimal point in the decimal expansion of Pi that is divisible by n.
%C For every positive integer n there exists a contiguous subsequence of the decimal expansion of Pi that is divisible by n (conjectured).
%F a(n) = n * A088143(n). - _Alois P. Heinz_, Dec 05 2024
%e a(3) = 141 is the first integer in the sequence that is divisible by 3.
%e a(6) = 141592653589793238 is the first integer in the sequence that is divisibe by 6.
%o (Python)
%o from mpmath import mp
%o mp.dps = 1000000
%o pi_digits = str(mp.pi)[2:]
%o def first_divisible(n):
%o current_number = 0
%o for digit in pi_digits:
%o current_number = current_number * 10 + int(digit)
%o if current_number % n == 0:
%o return current_number
%o return None
%o results = [first_divisible(n) for n in range(1, 21)]
%o print(results)
%Y Cf. A000796, A088143.
%Y Cf. A014777 (if start can move).
%K nonn,base,new
%O 1,2
%A _Simon R Blow_, Dec 02 2024