Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137746
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137746 Number of different strings of length n obtained from "abcdef" by iteratively duplicating any substring. +0
4
0, 0, 0, 0, 0, 0, 1, 6, 26, 100, 360, 1246, 4217, 14102, 46861 (list; graph; listen)
OFFSET

0,8

COMMENT

See A137743 for more comments.

LINKS

Index entries for doubling substrings

EXAMPLE

a(k) = 0 for k<6, since no shorter string can be obtained by duplication

a(6) = 1 = # { abcdef },

a(7) = 6 = # { aabcdef, abbcdef, abccdef, abcddef, abcdeef, abcdeff },

a(8) = 26 = # { aaabcdef, aabbcdef, aabccdef, aabcddef, aabcdeef, aabcdeff, ababcde,

abbbcdef, abbccdef, abbcddef, abbcdeef, abbcdeff, abcbcdef,

abcccdef, abccddef, abccdeef, abccdeff, abcdcdef,

abcdddef, abcddeef, abcddeff, abcdedef,

abcdeeef, abcdeeff, abcdefef, abcdefff }

PROGRAM

(PARI) A135473(14, 6) /*function defined in A137743...*/

CROSSREFS

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

Sequence in context: A143132 A055589 A055420 this_sequence A005022 A094811 A125107

Adjacent sequences: A137743 A137744 A137745 this_sequence A137747 A137748 A137749

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research