[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 A060690 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A060690 a(n) = binomial(2^n + n - 1, n).
(history; published version)
#51 by Alois P. Heinz at Fri Jul 05 09:54:29 EDT 2024
STATUS

reviewed

approved

#50 by Joerg Arndt at Fri Jul 05 09:40:12 EDT 2024
STATUS

proposed

reviewed

#49 by Chai Wah Wu at Fri Jul 05 09:39:42 EDT 2024
STATUS

editing

proposed

#48 by Chai Wah Wu at Fri Jul 05 09:39:37 EDT 2024
PROG

(Python)

from math import comb

def A060690(n): return comb((1<<n)+n-1, n) # Chai Wah Wu, Jul 05 2024

STATUS

approved

editing

#47 by Alois P. Heinz at Wed Jun 12 12:27:05 EDT 2024
STATUS

editing

approved

#46 by Alois P. Heinz at Wed Jun 12 12:26:34 EDT 2024
CROSSREFS

Central terms of A137153.

STATUS

approved

editing

#45 by Alois P. Heinz at Wed Jun 12 11:10:12 EDT 2024
STATUS

editing

approved

#44 by Alois P. Heinz at Wed Jun 12 11:07:20 EDT 2024
FORMULA

a(n) = A163767(2^n). - Alois P. Heinz, Jun 12 2024

CROSSREFS

Cf. A002416, A060336, A088309, A163767.

STATUS

approved

editing

#43 by Alois P. Heinz at Wed Feb 15 13:39:48 EST 2023
STATUS

editing

approved

#42 by Alois P. Heinz at Wed Feb 15 12:01:59 EST 2023
CROSSREFS

Cf. A136555, A220886.

STATUS

approved

editing

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 29 17:19 EDT 2024. Contains 375518 sequences. (Running on oeis4.)