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!)
A323595 Number of distinct sets of lengths of nonempty palindrome prefixes, over all binary words of length n. 0
1, 2, 4, 6, 10, 14, 21, 28, 39, 51, 69, 86, 111, 138, 176, 214, 264, 315, 385, 454, 546, 641, 763, 881, 1032, 1188, 1385, 1580, 1824, 2066, 2371, 2668, 3037, 3413, 3869, 4310, 4846, 5387, 6045 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

For n = 4, the 6 possible sets are:

{1}, corresponding to 0111.

{1,2}, corresponding to 0011.

{1,3}, corresponding to 0101.

{1,4}, corresponding to 0110.

{1,2,3}, corresponding to 0001.

{1,2,3,4}, corresponding to 0000.

CROSSREFS

Sequence in context: A280131 A082380 A238871 * A136460 A000065 A237758

Adjacent sequences:  A323592 A323593 A323594 * A323596 A323597 A323598

KEYWORD

nonn,more

AUTHOR

Jeffrey Shallit, Jan 18 2019

EXTENSIONS

a(23)-a(39) from Lars Blomberg, Feb 21 2019

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 August 3 05:55 EDT 2020. Contains 336197 sequences. (Running on oeis4.)