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.
consecGreedyJN[kmax_, len_] := Module[{m = 1, c = Table[False, {len}], s = {}}, Do[c = Join[Rest[c], {greedyJacobNivenQ[k]}]; If[And @@ c, AppendTo[s, k - len + 1]], {k, 1, kmax}]; s]; consecGreedyJN[350, 2] (* using the function greedyJacobNivenQ[n] from A364379 *)
lista(kmax, len) = {my(c = vector(len)); for(k = 1, kmax, c = concat(vecextract(c, "^1"), isA364379(k)); if(vecsum(c) == len, print1(k-len+1, ", ")));} \\ using the function isA364379(n) from A364379
lista(350, 2)
57744971 is a term since A291711(57744971) = 17 divides 57744971, A291711(57744972) = 18 divides 57744972, A291711(57744973) = 13 divides 57744973, A291711(57744974) = 14 divides 57744974, and A291711(57744975) = 15 divides 57744975.
mx = 20; fvec = vector(mx, i, fibonacci(2*i)); f(n) = if(n <= mx, fvec[n], fibonacci(2*n));
is1(n) = {my(s = 0, m = n, k); while(m > 0, k = 1; while(m > f(k), k++); if(m < f(k), k--); if(m >= 2*f(k), s += 2; m -= 2*f(k), s++; m -= f(k))); !(n % s);}
list(lim) = {my(q1 = is1(1), q2 = is1(2), q3 = is1(3), q4 = is1(4), s5); for(k = 5, lim, q5 = is1(k); if(q1 && q2 && q3 && q4 && q5, print1(k-4, ", ")); q1 = q2; q2 = q3; q3 = q4; q4 = q5);}
Comments