Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026572
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026572 a(n)=T(n,n-3), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=3. +0
2
1, 2, 8, 19, 56, 140, 376, 953, 2474, 6286, 16097, 40880, 104069, 264052, 670414, 1699831, 4310546, 10924970, 27690075, 70168812, 177820791, 450618964, 1142004584, 2894347667, 7336297080, 18597140982, 47148420564 (list; graph; listen)
OFFSET

3,2

COMMENT

Also, a(n)=T(n,n-3), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=3.

Cf. A026568, A026584.

CROSSREFS

Sequence in context: A126877 A107769 A026588 this_sequence A074797 A129445 A082821

Adjacent sequences: A026569 A026570 A026571 this_sequence A026573 A026574 A026575

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research