login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156024 n(n+1)/2 - A156022(n) 6
0, 1, 2, 4, 6, 9, 12, 15, 19, 23, 27, 32, 37, 42, 48, 54, 60, 66, 73, 80, 87, 94, 101, 109, 117, 125, 133, 142, 151, 160, 169 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

n(n+1)/2 is the total number of nonempty substrings of an n-bit binary number; A156022 is the maximum number of substrings representing distinct positive integers.

LINKS

Table of n, a(n) for n=1..31.

2008/9 British Mathematical Olympiad Round 2: Jan 29 2009, Problem 4

FORMULA

c_1 + o(1) <= a(n)/n^1.5 <= c_2 + o(1) for some positive constants c_1 and c_2; it seems likely a(n)/n^1.5 tends to some positive constant limit.

CROSSREFS

A078822, A112509, A112510, A112511, A122953, A156022, A156023, A156025. Equals A156023(n)+1 for n >= 2.

Sequence in context: A294060 A003066 A075349 * A234363 A194229 A194201

Adjacent sequences:  A156021 A156022 A156023 * A156025 A156026 A156027

KEYWORD

nonn

AUTHOR

Joseph Myers, Feb 01 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 01:27 EDT 2020. Contains 334828 sequences. (Running on oeis4.)