0,1

Faults in the generalization of Euler's Prime making sequence at Modulo ten seem to be deviations from a three letter alphabet and numbers ending in 5 in most cases.

Advanced Number Theory, Harvey Cohn, Dover Books,1963, Page 155

b[m]=Abs[1-4*b[m-2]]-2 a(n, m) = 10-Mod[n^2+n+b[m], 10]

{5},

{3, 9, 3},

{7, 3, 7, 9, 9, 7, 3, 7, 9},

{1, 7, 1, 3, 3, 1, 7, 1, 3, 3, 1, 7, 1, 3, 3},

{7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9},

{3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3,5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5, 3, 9, 3, 5, 5,3, 9, 3},

{7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7,

3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9,

7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7,

9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9,

7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3,

7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9,

9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9, 9, 7,

3, 7, 9, 9, 7, 3, 7, 9, 9, 7, 3, 7, 9}

a[1] = 3; a[2] = 5; a[3] = 11; a[n_] := a[n] = Abs[1 - 4*a[n - 2]] - 2; euler = Table[a[n], {n, 1, 10}] a0 = Table[Table[10-Mod[x^2 + x + euler[[i]], 10], {x, 1, euler[[i]] - 2}], {i, 1, 7}] MatrixForm[a0] b = Flatten[a0]

Cf. A082605.

Sequence in context: A073243 A134943 A105372 this_sequence A155496 A128426 A165789

Adjacent sequences: A107446 A107447 A107448 this_sequence A107450 A107451 A107452

nonn,uned

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 26 2005