Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094876
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094876 a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1; then a(n) = sum( a(2*i)*a(3*j)) where 1< = i< = n, 1< = j< = n and 2*i+3*j = n. +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 5, 2, 5, 5, 5, 5, 14, 5, 14, 14, 14, 14, 42, 14, 42, 42, 42, 42, 132, 42, 132, 132, 132, 132, 429, 132, 429, 429, 429, 429, 1430, 429, 1430, 1430, 1430, 1430, 4862, 1430, 4862, 4862, 4862, 4862, 16796, 4862, 16796, 16796 (list; graph; listen)
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 December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research