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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137744 Number of different strings of length n obtained from "abcd" by iteratively duplicating any substring. 11
0, 0, 0, 0, 1, 4, 13, 40, 119, 348, 1014, 2966, 8726 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

See A137743 for more comments.

LINKS

Index entries for doubling substrings

EXAMPLE

a(4) = # { abcd }, a(5) = # { aabcd, abbcd, abccd, abcdd },

a(6) = # { aaabcd, aabbcd, aabccd, aabcdd, ababcd, abbbcd, abbccd, abbcdd, abcbcd, abcccd, abccdd, abcdcd, abcddd }

PROG

(PARI) A135473(12, 4)

CROSSREFS

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

Sequence in context: A000746 A191132 A119915 * A027130 A027121 A025567

Adjacent sequences:  A137741 A137742 A137743 * A137745 A137746 A137747

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 14 18:47 EST 2012. Contains 205663 sequences.