|
| |
| |
|
|
|
0, 0, 0, 1, 4, 9, 20, 37, 64, 102, 156, 228, 324, 446, 600, 791, 1024, 1305, 1640, 2036, 2500, 3038, 3660, 4372, 5184, 6103, 7140, 8303, 9604, 11051, 12656, 14430, 16384, 18530, 20880, 23447, 26244, 29283, 32580, 36147, 40000, 44152, 48620, 53418
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
FORMULA
| a(n) =[A000583(n)/64] =[A011863(n-1)/4]. a(2n)=A059403(2n); a(2n-1)=A059403(2n-1)+A011861(n).
a(n)= +4*a(n-1) -6*a(n-2) +4*a(n-3) -a(n-4) +a(n-16) -4*a(n-17) +6*a(n-18) -4*a(n-19) +a(n-20). G.f. -x^3 *(1 -x^2 +4*x^3 -4*x^4 -3*x^6 +4*x^7 -3*x^8 +4*x^9 -4*x^10 +4*x^11 -x^12 +x^14 +4*x^5) / ( (1+x) *(x^2+1) *(x^4+1) *(x^8+1) *(x-1)^5 ). - R. J. Mathar, Mar 24 2011
|
|
|
EXAMPLE
| a(9)=[9^4/64]=[6561/64]=[102.51562..]=102.
|
|
|
PROG
| (PARI) { for (n=0, 1000, write("b060494.txt", n, " ", floor(n^4/64)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 06 2009]
|
|
|
CROSSREFS
| Sequence in context: A059403 A009909 A009910 * A049748 A192956 A023607
Adjacent sequences: A060491 A060492 A060493 * A060495 A060496 A060497
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Henry Bottomley (se16(AT)btinternet.com), Mar 21 2001
|
| |
|
|
