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 A252702 #13 Mar 24 2017 00:47:57
%S A252702 0,9,72,576,5112,45432,408312,3669696,33022152,297153936,2674339992,
%T A252702 24068651616,216617456232,1949553436392,17545977257832,
%U A252702 157913762298336,1421223827662872,12791014151811912,115119127069153272,1036072140948039456,9324649265858015112
%N A252702 Number of strings of length n over a 9-letter alphabet that do not begin with a palindrome.
%C A252702 9 divides a(n) for all n.
%C A252702 lim n -> infinity a(n)/9^n ~ 0.766976957370438 is the probability that a random, infinite string over a 9-letter alphabet does not begin with a palindrome.
%C A252702 This sequence gives the number of walks on K_9 with loops that do not begin with a palindromic sequence.
%H A252702 Peter Kagey, <a href="/A252702/b252702.txt">Table of n, a(n) for n = 0..1000</a>
%F A252702 a(n) = 9^n - A249642(n) for n > 0.
%e A252702 For n = 3, the first 10 of the a(3) = 576 solutions are (in lexicographic order) 011, 012, 013, 014, 015, 016, 017, 018, 021, 022.
%o A252702 (Ruby) seq = [1, 0]; (2..N).each { |i| seq << 9 * seq[i-1] + 9**((i+1)/2) - seq[(i+1)/2] }; seq = seq.each_with_index.collect { |a, i| 9**i - a }
%Y A252702 A249642 gives the number of strings of length n over a 9-letter alphabet that DO begin with a palindrome.
%Y A252702 Analogous sequences for k-letter alphabets: A252696 (k=3), A252697 (k=4), A252698 (k=5), A252699 (k=6), A252700 (k=7), A252701 (k=8), A252703 (k=10).
%K A252702 easy,nonn,walk
%O A252702 0,2
%A A252702 _Peter Kagey_, Dec 20 2014