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.

A112048 Bisection of A112046.

This page as a plain text file.
%I A112048 #17 May 06 2021 12:20:18
%S A112048 2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,11,2,3,2,3,
%T A112048 2,5,2,3,2,3,2,13,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,7,2,3,2,3,2,5,2,3,
%U A112048 2,3,2,17,2,3,2,3,2,5,2,3,2,3,2,5,2,3,2,3,2,19,2,3,2,3,2,5,2,3,2,3,2
%N A112048 Bisection of A112046.
%H A112048 Vincenzo Librandi, <a href="/A112048/b112048.txt">Table of n, a(n) for n = 1..1000</a>
%F A112048 a(n) = A112046(2n).
%t A112048 a112046[n_]:=Block[{i=1}, While[JacobiSymbol[i, 2n + 1]==1, i++]; i]; Table[a112046[2n] , {n, 101}] (* _Indranil Ghosh_, May 24 2017 *)
%o A112048 (Python)
%o A112048 from sympy import jacobi_symbol as J
%o A112048 def a112046(n):
%o A112048     i=1
%o A112048     while True:
%o A112048         if J(i, 2*n + 1)!=1: return i
%o A112048         else: i+=1
%o A112048 def a(n): return a112046(2*n)
%o A112048 print([a(n) for n in range(1, 102)])  # _Indranil Ghosh_, May 24 2017
%Y A112048 Cf. A112046, A112047, A112053.
%K A112048 nonn
%O A112048 1,1
%A A112048 _Antti Karttunen_, Aug 27 2005