login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137745 Number of different strings of length n obtained from "abcde" by iteratively duplicating any substring. 3
0, 0, 0, 0, 0, 1, 5, 19, 66, 218, 700, 2218, 6997, 22064 (list; graph; refs; listen; history; internal format)
OFFSET

0,7

COMMENTS

See A137743 for more comments.

LINKS

Index entries for doubling substrings

EXAMPLE

a(k) = 0 for k<5, since no shorter string can be obtained by duplicating a substring.

a(5) = # { abcde }, a(6) = # { aabcde, abbcde, abccde, abcdde, abcdee },

a(7) = # { aaabcde, aabbcde, aabccde, aabcdde, aabcdee, ababcde, abbbcde, abbccde, abbcdde, abbcdee, abcbcde, abcccde, abccdde, abccdee, abcdcde, abcddde, abcddee, abcdede, abcdeee }

PROG

(PARI) A135473(13, 5) /* function defined in A137743...*/

CROSSREFS

Cf. A137740-A137743, A135473, A137744-A137748.

Sequence in context: A099448 A124806 A059509 * A005021 A067325 A121525

Adjacent sequences:  A137742 A137743 A137744 * A137746 A137747 A137748

KEYWORD

more,nonn

AUTHOR

M. F. Hasler (www.univ-ag.fr/~mhasler), Feb 10 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:25 EST 2012. Contains 205907 sequences.