The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137317 Array T(n,m) = 1 + (n+m-2) mod 26, 1 <= n,m <= 26, read by rows or columns. 2

%I

%S 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,

%T 2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,1,

%U 3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22

%N Array T(n,m) = 1 + (n+m-2) mod 26, 1 <= n,m <= 26, read by rows or columns.

%C The pattern arises if one assigns numbers A=1 up to Z=26 to the letters in the 26 X 26 Vigenere square, which contains A to Z in the first row and circular shifts in the follow-up rows (that is, B..Z,A in the 2nd, C...Z,A,B in the 3rd etc.).

%D Blaise de Vigenere, Traicte des chiffres ou secretes manieres d'ecrire. Paris. Abel L'Angelier (1586). Section 343, (1)ff, "Separated illustrations". Based on Bellaso, 1553.

%H Nathaniel Johnston, <a href="/A137317/b137317.txt">Rows 1..26, flattened</a> (full sequence)

%e The array begins:

%e 1 2 3 4 5 6 7 8 9 10 ...

%e 2 3 4 5 6 7 8 9 10 11

%e 3 4 5 6 7 8 9 10 11 12

%e 4 5 6 7 8 9 10 11 12 13

%e 5 6 7 8 9 10 11 12 13 14

%e 6 7 8 9 10 11 12 13 14 15

%e 7 8 9 10 11 12 13 14 15 16

%e 8 9 10 11 12 13 14 15 16 17

%e ...

%p for n from 1 to 26 do seq(1 + ((n+m-2) mod 26), m=1..26); od; # _Nathaniel Johnston_, Jun 23 2011

%t Flatten[Table[1+Mod[n+m-2,26],{n,10},{m,26}]] (* _Harvey P. Dale_, Feb 05 2012 *)

%K nonn,tabf,less,fini,full,word

%O 1,2

%A _Paul Curtz_, Apr 06 2008

%E Edited by _R. J. Mathar_, Aug 06 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 5 10:33 EDT 2020. Contains 333239 sequences. (Running on oeis4.)