Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137744
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137744 Number of different strings of length n obtained from "abcd" by iteratively duplicating any substring. +0
12
0, 0, 0, 0, 1, 4, 13, 40, 119, 348, 1014, 2966, 8726 (list; graph; listen)
OFFSET

0,6

COMMENT

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 }

PROGRAM

(PARI) A135473(12, 4)

CROSSREFS

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

Sequence in context: A133409 A000746 A119915 this_sequence A027130 A027121 A025567

Adjacent sequences: A137741 A137742 A137743 this_sequence A137745 A137746 A137747

KEYWORD

more,nonn

AUTHOR

M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 10 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research