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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144866 Shadow transform of C(n+4,5) = A000389(n+4). 1
1, 1, 2, 1, 1, 3, 5, 2, 4, 1, 5, 3, 5, 8, 1, 2, 5, 6, 5, 1, 11, 7, 5, 6, 1, 7, 4, 8, 5, 4, 5, 2, 11, 8, 4, 7, 5, 7, 11, 2, 5, 15, 5, 9, 4, 8, 5, 6, 5, 1, 12, 8, 5, 6, 3, 13, 12, 7, 5, 4, 5, 8, 22, 2, 8, 16, 5, 11, 11, 6, 5, 12, 5, 7, 1, 8, 25, 16, 5, 2, 4, 8, 5, 22, 5, 7, 11, 15, 5, 6, 25, 8, 11, 8, 5, 5 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

N. J. A. Sloane, Transforms

MAPLE

shadow:= proc(p) proc(n) local j; add (`if` (modp(p(j), n)=0, 1, 0), j=0..n-1) end end: f:= proc(k) proc(n) binomial (n+k-1, k) end end: a:= n-> shadow (f(5))(n): seq (a(n), n=1..120);

CROSSREFS

5th column of A144871. Cf. A007318.

Sequence in context: A189435 A090234 A007754 * A058732 A060082 A102225

Adjacent sequences:  A144863 A144864 A144865 * A144867 A144868 A144869

KEYWORD

nonn

AUTHOR

Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 23 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.