cp's OEIS Frontend

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.

A348269 A 5 X 5 pandiagonal magic square read by rows: the entries have digits which are only 0's and 1's and form a magic square in any base b >= 2.

This page as a plain text file.
%I A348269 #14 Dec 05 2021 00:21:53
%S A348269 11,1100,110000,11000000,1100000000,10010000,1001000000,100000001,110,
%T A348269 101000,100000100,100010,10001000,1000010000,1000001,1000001000,10001,
%U A348269 1000100,100100000,10000010,1100000,110000000,1000000010,1001,10100
%N A348269 A 5 X 5 pandiagonal magic square read by rows: the entries have digits which are only 0's and 1's and form a magic square in any base b >= 2.
%C A348269 The magic square is:
%C A348269   [         11,       1100,     110000,   11000000, 1100000000 ]
%C A348269   [   10010000, 1001000000,  100000001,        110,     101000 ]
%C A348269   [  100000100,     100010,   10001000, 1000010000,    1000001 ]
%C A348269   [ 1000001000,      10001,    1000100,  100100000,   10000010 ]
%C A348269   [    1100000,  110000000, 1000000010,       1001,      10100 ]
%C A348269 The magic sum of any row, column or diagonal is 1111111111.
%C A348269 This has the form
%C A348269   A+B    C+D    E+F    G+H    I+J
%C A348269   E+H    G+J    A+I    C+B    D+F
%C A348269   C+I    B+F    D+H    E+J    G+A
%C A348269   D+J    A+E    G+C    I+F    B+H
%C A348269   G+F    I+H    B+J    A+D    C+E
%C A348269 with magic sum = A+B+C+D+E+F+G+H+I+J.
%H A348269 <a href="/index/Mag#magic">Index entries for sequences related to magic squares</a>
%F A348269 (C#)
%F A348269 long[,] A348269()
%F A348269 {
%F A348269     long A = 1;
%F A348269     long B = 10;
%F A348269     long C = 100;
%F A348269     long D = 1000;
%F A348269     long E = 10000;
%F A348269     long F = 100000;
%F A348269     long G = 1000000;
%F A348269     long H = 10000000;
%F A348269     long I = 100000000;
%F A348269     long J = 1000000000;
%F A348269     return new long[,] {
%F A348269       { A+B, C+D, E+F, G+H, I+J },
%F A348269       { E+H, G+J, A+I, C+B, D+F },
%F A348269       { C+I, B+F, D+H, E+J, G+A},
%F A348269       { D+J, A+E, G+C, I+F, B+H },
%F A348269       { G+F, I+H, B+J, A+D, C+E }
%F A348269     };
%F A348269 }
%Y A348269 Cf. A347911.
%K A348269 nonn,fini,full
%O A348269 1,1
%A A348269 _Chittaranjan Pardeshi_, Oct 09 2021