login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038730 Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i,j). 5
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; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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

LINKS

Table of n, a(n) for n=1..55.

EXAMPLE

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

CROSSREFS

Sequence in context: A194363 A161135 A237274 * A188106 A050166 A124959

Adjacent sequences:  A038727 A038728 A038729 * A038731 A038732 A038733

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling, May 02 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 10:24 EST 2019. Contains 320310 sequences. (Running on oeis4.)