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.
The primes that are > a(8)=41 form the sequence 43,47,53,59,61,67,71,... Of these, 67 is the smallest that when added to a(8)=41 gets a multiple of 9 -- 41+67 = 108 = 9*12. (41+p is not divisible by 9 for p = any prime which is > 41 and is < 67.) So a(9) = 67.
a = {2}; For[n = 1, n < 100, n++, i = 1; While[Not[Mod[a[[ -1]] + Prime[PrimePi[a[[ -1]]] + i], n] == 0], i++ ]; AppendTo[a, Prime[PrimePi[a[[ -1]]] + i]]]; a (* Stefan Steinerberger, Oct 17 2007 *)
def A134207(max) : res = [2]; p = 3 for n in range(1,max+1) : while (res[n-1] + p) % n != 0 : p = next_prime(p) res.append(p); p = next_prime(p) return res # Eric M. Schmidt, May 23 2013
Comments