Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033193
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033193 Binomial transform of A033192. +0
1
1, 2, 6, 19, 62, 207, 704, 2430, 8486, 29903, 106098, 378391, 1354700, 4863834, 17499302, 63055947, 227465414, 821215295, 2966571096, 10721076118, 38757594758, 140143505031, 506827217210, 1833150646599 (list; graph; listen)
OFFSET

0,2

COMMENT

Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,....,2n, s(0) = 3, s(2n) = 3. - Herbert Kociemba (kociemba(AT)t-online.de), Jun 16 2004

LINKS

N. J. A. Sloane, Transforms

FORMULA

G.f.: (x^4-7x^3+11x^2-6x+1)/[(1-3x+x^2)(1-5x+5x^2)].

a(n)=(1/5)*Sum(r, 1, 9, Sin(3*r*Pi/10)^2(2Cos(r*Pi/10))^(2n)), n>=1 - Herbert Kociemba (kociemba(AT)t-online.de), Jun 16 2004

CROSSREFS

Sequence in context: A094817 A033565 A094831 this_sequence A071738 A026012 A120900

Adjacent sequences: A033190 A033191 A033192 this_sequence A033194 A033195 A033196

KEYWORD

nonn

AUTHOR

njas

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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research