Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137742
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137742 a(n)=(n-1)(n+4)(n+6)/6 for n>1, a(1)=1. +0
4
1, 8, 21, 40, 66, 100, 143, 196, 260, 336, 425, 528, 646, 780, 931, 1100, 1288, 1496, 1725, 1976, 2250, 2548, 2871, 3220 (list; graph; listen)
OFFSET

1,2

COMMENT

Also the number of different strings of length n+3 obtained from "123...n" by iteratively duplicating any substring (see A137743 for comments and examples). This is the principal (although not simplest) definition of this sequence and explains why a(1)=1 and not 0.

LINKS

Index entries for doubling substrings

PROGRAM

(PARI) A137742(n)=if(n<2, 1, n=A135473(n+3, n); n[ #n]) /* function A135473 defined in A137743 */

(PARI) A137742(n)=if(n<2, 1, (n - 1)*(n + 4)*(n + 6)/6)

CROSSREFS

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

Sequence in context: A154894 A000567 A124484 this_sequence A152117 A075629 A067334

Adjacent sequences: A137739 A137740 A137741 this_sequence A137743 A137744 A137745

KEYWORD

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research