This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047881 a(n)=Sum{T(h,k): h=0,1,...,n; k=0,1,...,n}, array T counting knights' moves as in A049604. 0
 0, 10, 20, 38, 62, 100, 150, 220, 302, 410, 536, 692, 868, 1080, 1316, 1594, 1898, 2248, 2630, 3064, 3530, 4054, 4616, 5240, 5904, 6636, 7412, 8262, 9158, 10132, 11158, 12268, 13430, 14682, 15992, 17396, 18860, 20424, 22052 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA Conjecture: a(n) = a(n-1) + a(n-2) - 2*a(n-5) + a(n-8) + a(n-9) - a(n-10) for n > 11. - Chai Wah Wu, May 25 2016 CROSSREFS Sequence in context: A048011 A188334 A266087 * A172172 A275245 A020953 Adjacent sequences:  A047878 A047879 A047880 * A047882 A047883 A047884 KEYWORD nonn AUTHOR STATUS approved

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