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.
%I A192553 #9 Mar 24 2017 00:47:53
%S A192553 1,2,5,15,51,197,850,3897,19461,104264
%N A192553 Sums of powers of permutations of length n.
%C A192553 Permutations of length n can be represented by an ordered list of the first n integers. Summing vertically the lists corresponding to the successive powers of a permutation up to its order ord, gives a new list of n integers from ord to n*ord. a(n) gives the number of different such lists. a(n) is related to the Bell numbers and majored by them, as permutations with the same cycle decomposition will have the same order and only a different ordering of powers.
%F A192553 a(n) <= Bell(n)
%e A192553 {2, 1, 3, 6, 4, 5} is a permutation of length 6 and order 6. Its successive powers are
%e A192553 {2, 1, 3, 6, 4, 5},
%e A192553 {1, 2, 3, 5, 6, 4},
%e A192553 {2, 1, 3, 4, 5, 6},
%e A192553 {1, 2, 3, 6, 4, 5},
%e A192553 {2, 1, 3, 5, 6, 4},
%e A192553 {1, 2, 3, 4, 5, 6}. Their sum is
%e A192553 {9, 9, 18, 30, 30, 30} or
%e A192553 {8, 7, 15, 26, 25, 24} if one does not includes the identity.
%e A192553 There are 197 different sums for n=6.
%Y A192553 Cf. A000110, A051625.
%K A192553 nonn
%O A192553 1,2
%A A192553 _Olivier Gérard_, Jul 04 2011