Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026555
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026555 a(n)=T(n,n-2), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=2. +0
1
1, 2, 7, 13, 40, 76, 226, 434, 1279, 2470, 7267, 14085, 41462, 80584, 237484, 462620, 1365014, 2664276, 7870226, 15387670, 45501743, 89097932, 263707094, 517058502, 1531614109, 3006637946, 8912678569, 17514547015, 51952990090 (list; graph; listen)
OFFSET

1,2
CROSSREFS

Adjacent sequences: A026552 A026553 A026554 this_sequence A026556 A026557 A026558

Sequence in context: A079119 A051748 A086904 this_sequence A129592 A153136 A127487

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.