Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038730
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038730 Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i,j). +0
6
1, 1, 2, 1, 4, 5, 1, 6, 12, 13, 1, 8, 23, 33, 34, 1, 10, 38, 73, 88, 89, 1, 12, 57, 141, 211, 232, 233, 1, 14, 80, 245, 455, 581, 609, 610, 1, 16, 107, 393, 888, 1350, 1560, 1596, 1597, 1, 18, 138, 593, 1594, 2881, 3805, 4135, 4180, 4181 (list; table; graph; listen)
OFFSET

1,3

COMMENT

T(n,n)=A001519(n) for n >= 1 (odd-indexed Fibonacci numbers).

EXAMPLE

Rows: {1}; {1,2}; {1,4,5}; {1,6,12,13}; ...

CROSSREFS

Sequence in context: A129874 A021983 A161135 this_sequence A050166 A124959 A081281

Adjacent sequences: A038727 A038728 A038729 this_sequence A038731 A038732 A038733

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), May 02 2000

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research