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

Showing entries 1-10 | older changes
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).
(history; published version)
#28 by Michael De Vlieger at Fri May 19 08:02:04 EDT 2023
STATUS

reviewed

approved

#27 by Joerg Arndt at Fri May 19 07:18:49 EDT 2023
STATUS

proposed

reviewed

#26 by Andrew Howroyd at Thu May 18 14:22:00 EDT 2023
STATUS

editing

proposed

Discussion
Thu May 18 14:24
Harry Richman: I only wanted credit for the last comment, since the others are trivial. But I will do so in the future if that is the convention.
14:24
Andrew Howroyd: 1/2 * A000984(2^n) is considered ambiguous (see 5th bullet of https://oeis.org/wiki/Style_Sheet#Spelling_and_notation). Rather write (1/2) * A000984(2^n) or A000984(2^n)/2, assuming that is what you mean.
14:26
Harry Richman: Ok that makes sense about ambiguous notation, thanks for pointing this out!
14:44
Andrew Howroyd: We usually want you to take credit for trivial formulas too. (triviality is too much of a slippery slope - anything added to Formulas section should be signed - the more routine it is, the more people understand that the addition of a formula really doesn't really carry a lot of deeper significance. It's up to the reader to decide if a formula is likely original work or just fact filling - sometimes obvious, often not. In this sense 'credit' is almost impossible to establish. In contrast, in a mathematical paper authors go to great length to attribute all sources of information, but a paper takes a lot of effort to write and research whereas here the emphasis is on efficiently collecting the facts and ease of research)
#25 by Andrew Howroyd at Thu May 18 14:20:19 EDT 2023
FORMULA

From Harry Richman, May 18 2023: (Start)

log log a(n) ~ (log 2) * (n + 1) + log log 2 + O(n / 2^n). - _Harry Richman_, May 18 2023.). (End)

STATUS

proposed

editing

Discussion
Thu May 18 14:22
Andrew Howroyd: When adding more than one formula, you need to use a block comment - otherwise it is impossible to know where your contribution starts. See 2nd bullet of https://oeis.org/wiki/Style_Sheet#Signing_your_name_when_you_contribute_to_an_existing_sequence
#24 by Harry Richman at Thu May 18 14:15:41 EDT 2023
STATUS

editing

proposed

#23 by Harry Richman at Thu May 18 14:15:38 EDT 2023
FORMULA

a(n) = A001790(2^n). - _Harry Richman_, May 18 2023.).

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). - Harry Richman, May 18 2023.

CROSSREFS

Cf. A000051, A000108, A000984, A001790, A061548.

#22 by Harry Richman at Thu May 18 13:21:04 EDT 2023
FORMULA

a(n) = A001790(2^n) _). - _Harry Richman_, May 18 2023.

#21 by Harry Richman at Thu May 18 13:20:31 EDT 2023
FORMULA

a(n) = A001790(2^n) Harry Richman, May 18 2023.

CROSSREFS

Cf. A000051, A001790, A061548.

STATUS

approved

editing

#20 by Peter Luschny at Tue Aug 16 10:45:25 EDT 2022
STATUS

editing

approved

#19 by Peter Luschny at Tue Aug 16 10:44:55 EDT 2022
FORMULA

a(n) = binomial(2^(n+1), 2^n)/2 = binomial(2^(n+1) - 1, 2^n) = binomial(2^(n+1) - 1, 2^n - 1).

Discussion
Tue Aug 16 10:45
Peter Luschny: Neil, please stop these repetitions.

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 23:09 EDT 2024. Contains 375519 sequences. (Running on oeis4.)