[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A026598 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A026598 a(n) = Sum_{i=0..n} Sum_{j=0..i} T(i,j), T given by A026584.
(history; published version)
#11 by Joerg Arndt at Wed Dec 15 01:18:49 EST 2021
STATUS

reviewed

approved

#10 by Michel Marcus at Wed Dec 15 00:32:27 EST 2021
STATUS

proposed

reviewed

#9 by G. C. Greubel at Wed Dec 15 00:29:28 EST 2021
STATUS

editing

proposed

#8 by G. C. Greubel at Wed Dec 15 00:26:36 EST 2021
NAME

Sum{Ta(n) = Sum_{i,j)}, =0<=..n} Sum_{j<=i, =0<=..i} T(i<=n, ,j), T given by A026584.

LINKS

G. C. Greubel, <a href="/A026598/b026598.txt">Table of n, a(n) for n = 0..500</a>

FORMULA

a(n) = Sum_{i=0..n} Sum_{j=0..i} A026584(i, j).

Conjecture: n*a(n) +(-) - (4*n+-3)*a(n-1) +(-) - (2*n+-3)*a(n-2) +) + 5*(4*n-9)*a(n-3) +) - 7*(-*(n+-3)*a(n-4) +) - 6*(-*(4*n+-15)*a(n-5) +) + 8*(2*n-9)*a(n-6)=) = 0. - R. J. Mathar, Jun 23 2013

MATHEMATICA

T[n_, k_]:= T[n, k]= If[k<0 || k>2*n, 0, If[k==0 || k==2*n, 1, If[k==1 || k==2*n - 1, Floor[n/2], If[EvenQ[n+k], T[n-1, k-2] + T[n-1, k], T[n-1, k-2] + T[n-1, k-1] + T[n-1, k] ]]]];

a[n_]:= a[n]= Block[{$RecursionLimit = Infinity}, Sum[T[i, j], {i, 0, n}, {j, 0, i}]];

Table[a[n], {n, 0, 40}] (* G. C. Greubel, Dec 15 2021 *)

PROG

(Sage)

@CachedFunction

def T(n, k): # T = A026584

if (k==0 or k==2*n): return 1

elif (k==1 or k==2*n-1): return (n//2)

else: return T(n-1, k-2) + T(n-1, k) if ((n+k)%2==0) else T(n-1, k-2) + T(n-1, k-1) + T(n-1, k)

@CachedFunction

def A026598(n): return sum(sum(T(i, j) for j in (0..i)) for i in (0..n))

[A026598(n) for n in (0..40)] # G. C. Greubel, Dec 15 2021

CROSSREFS

Cf. A026584, A026585, A026587, A026589, A026590, A026591, A026592, A026593, A026594, A026595, A026596, A026597, A026599, A027282, A027283, A027284, A027285, A027286.

STATUS

approved

editing

#7 by R. J. Mathar at Sun Jun 23 12:53:12 EDT 2013
STATUS

editing

approved

#6 by R. J. Mathar at Sun Jun 23 12:13:16 EDT 2013
FORMULA

Conjecture: n*a(n) +(-4*n+3)*a(n-1) +(-2*n+3)*a(n-2) +5*(4*n-9)*a(n-3) +7*(-n+3)*a(n-4) +6*(-4*n+15)*a(n-5) +8*(2*n-9)*a(n-6)=0. - R. J. Mathar, Jun 23 2013

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:56:09 EDT 2012
AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Clark Kimberling

Discussion
Fri Mar 30 18:56
OEIS Server: https://oeis.org/edit/global/285
#4 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005
NAME

SUMSum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026584.

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling, (ck6(AT)evansville.edu)

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling, ck6@cedar.(AT)evansville.edu

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 07:08 EDT 2024. Contains 375531 sequences. (Running on oeis4.)