editing
approved
editing
approved
Project Euler, <a href="httphttps://projecteuler.net/problem=225">Problem #225: Tribonacci non-divisors</a>
approved
editing
V. Raman and _Charles R Greathouse IV_, , <a href="/A215964/b215964.txt">Table of n, a(n) for n = 1..1000</a> (first 107 terms from Raman)
V. Raman and _Charles R Greathouse IV, _, <a href="/A215964/b215964.txt">Table of n, a(n) for n = 1..1000</a> (first 107 terms from Raman)
V. Raman and Charles R Greathouse IV, <a href="/A215964/b215964_1.txt">Table of n, a(n) for n = 1..1000</a> (first 107 terms from Raman)
proposed
approved
editing
proposed
Project Euler, <a href="http://projecteuler.net/problem=225">Problem #225</a>
Project Euler, <a href="http://projecteuler.net/problem=225">Problem #225</a>
V. Raman, and Charles R Greathouse IV, <a href="/A215964/b215964_1.txt">Table of n, a(n) for n = 1..1000</a> (first 107</a> terms from Raman)
(PARI) is(n)=my(a=1, b=1, c=1, t); for(i=1, n^2, t=(a+b+c)%n; if(t, a=b; b=c; c=t, return(0)); if(c==1&&b==1&&a==1, return(isprime(n)))) \\ Charles R Greathouse IV, Aug 29 2012
proposed
editing
editing
proposed