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!)
A069954 a(n) = binomial(2^(n+1), 2^n)/2 = binomial(2^(n+1) - 1, 2^n) = binomial(2^(n+1) - 1, 2^n-1). 3
1, 3, 35, 6435, 300540195, 916312070471295267, 11975573020964041433067793888190275875, 2884329411724603169044874178931143443870105850987581016304218283632259375395 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Terms are always odd. a(1) = A061548(2), a(2) = A061548(3), a(3) = A061548(5), a(4) = A061548(9), a(5) = A061548(17), ... Hence it seems that a(n) = A061548(A000051(n)).
C(2*k, k)/2 = C(2*k-1, k) = C(2*k-1, k-1) is odd if and only if k = 2^n. - Michael Somos, Mar 12 2014
LINKS
FORMULA
From Harry Richman, May 18 2023: (Start)
a(n) = A001790(2^n).
a(n) = 1/2 * A000984(2^n).
a(n) = 1/2 * (2^n + 1) * A000108(2^n).
log log a(n) ~ (log 2) * (n + 1) + log log 2 + O(n / 2^n). (End)
EXAMPLE
C(2,1)/2 = C(1,0) = C(1,1) = 1. C(4,2)/2 = C(3,1) = C(3,2) = 3. C(8,4)/2 = C(7,3) = C(7,4) = 35. - Michael Somos, Mar 12 2014
MATHEMATICA
Table[Binomial[2^(n+1) -1, 2^n -1], {n, 0, 10}] (* Vincenzo Librandi, Mar 14 2014 *)
PROG
(Magma) [Binomial(2^(n+1)-1, 2^n-1): n in [0..10]]; // Vincenzo Librandi, Mar 14 2014
(SageMath) [binomial(2^(n+1) -1, 2^n) for n in (0..9)] # G. C. Greubel, Aug 16 2022
CROSSREFS
Sequence in context: A132941 A068002 A132557 * A134098 A132513 A034174
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Apr 27 2002
EXTENSIONS
a(0) = 1 added by Michael Somos, Mar 12 2014
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 00:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)