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.
isMotzkin[n_, k_] := Module[{s = 0, r = True}, Do[s += JacobiSymbol[i, n]; If[s < 0, r = False; Break[]], {i, 1, k}]; r]; A095100[n_] := Select[4*Range[0, n+1]+3, isMotzkin[#, Quotient[#, 2]] &]; A095100[90] (* Jean-François Alcover, Oct 08 2013, translated from Sage *)
isok(m) = {if(m%4<3, return(0)); my(s=0); for(i=1, m-1, if((s+=kronecker(i, m))<0, return(0))); 1; } \\ Jinyuan Wang, Jul 20 2020
def is_Motzkin(n, k):
s = 0
for i in range(1, k + 1) :
s += jacobi_symbol(i, n)
if s < 0: return False
return True
def A095100_list(n):
return [m for m in range(3, n + 1, 4) if is_Motzkin(m, m // 2)]
A095100_list(363) # Peter Luschny, Aug 08 2012
L = {}; Do[p = Prime[k]; If[Mod[p, 4] == 3 && Min[Table[Sum[JacobiSymbol[n, p], {n, 0, m}], {m, 0, p - 1}]] < 0, L = Append[L, p]], {k, 1, 192}]; L (* From Jonathan Sondow, Oct 25 2011 *)
isok(m) = {my(s=0); if(m%4==3&&isprime(m), for(i=1, m-1, if((s+=kronecker(i, m))<0, return(1)))); 0; } \\ Jinyuan Wang, Jul 20 2020
def A095103_list(n) : def is_Motzkin(n, k): s = 0 for i in (1..k) : s += jacobi_symbol(i, n) if s < 0 : return false return true P = filter(is_prime, range(n+1)[3::4]) return filter(lambda m: not is_Motzkin(m, m//2), P) A095103_list(1163) # Peter Luschny, Aug 08 2012
Comments