Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144865
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144865 Shadow transform of C(n+3,4) = A000332(n+3). +0
2
1, 1, 1, 1, 4, 1, 4, 1, 2, 4, 4, 1, 4, 5, 6, 1, 4, 3, 4, 4, 5, 3, 4, 1, 4, 4, 2, 3, 4, 5, 4, 1, 5, 6, 16, 2, 4, 3, 6, 4, 4, 5, 4, 4, 9, 5, 4, 1, 4, 6, 7, 2, 4, 2, 16, 2, 7, 4, 4, 5, 4, 5, 11, 1, 16, 7, 4, 7, 6, 16, 4, 2, 4, 4, 5, 2, 16, 5, 4, 4, 2, 6, 4, 5, 16, 3, 5, 6, 4, 13, 16, 3, 6, 5, 16, 1, 4, 6, 10, 3, 4 (list; graph; listen)
OFFSET

1,5

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(4))(n): seq (a(n), n=1..120);

CROSSREFS

4th column of A144871. Cf. A007318.

Sequence in context: A100086 A140704 A030748 this_sequence A096622 A080905 A010685

Adjacent sequences: A144862 A144863 A144864 this_sequence A144866 A144867 A144868

KEYWORD

nonn

AUTHOR

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

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research