Quote:
Originally Posted by Citrix

1) get an OEIS account, ( or use somebody who has one) to edit the sequence.
2) modular remainders are inefficient but give that if a(n1) is 2 mod 3, k is odd, if a(n1) is 1 mod 3,k is even.( Oops math for the related sequence)
3) no clue.