The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229149 a(n) = n^6*(4*n+3). 2
 0, 7, 704, 10935, 77824, 359375, 1259712, 3647119, 9175040, 20726199, 43000000, 83263367, 152285184, 265474495, 444242624, 717609375, 1124073472, 1713767399, 2550916800, 3716624599, 5312000000, 7461652527, 10317571264, 14063409455, 18919194624, 25146484375 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Number of ascending runs in {1,...,n}^7. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 FORMULA G.f.: (x^6+312*x^5+4029*x^4+9664*x^3+5499*x^2+648*x+7)*x/(x-1)^8. MAPLE a:= n-> n^6*(4*n+3): seq(a(n), n=0..40); CROSSREFS Row n=7 of A229079. Sequence in context: A174855 A186160 A129291 * A159815 A070746 A068004 Adjacent sequences: A229146 A229147 A229148 * A229150 A229151 A229152 KEYWORD nonn,easy AUTHOR Alois P. Heinz, Sep 15 2013 STATUS approved

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

Last modified September 21 21:57 EDT 2023. Contains 365503 sequences. (Running on oeis4.)