Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144869
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144869 Shadow transform of C(n+7,8) = A000581(n+7). +0
2
1, 1, 2, 1, 3, 1, 1, 1, 6, 2, 8, 1, 8, 1, 8, 1, 8, 6, 8, 1, 3, 6, 8, 1, 6, 7, 6, 1, 8, 7, 8, 1, 21, 14, 4, 7, 8, 8, 21, 1, 8, 2, 8, 8, 21, 7, 8, 1, 2, 6, 21, 4, 8, 5, 26, 1, 21, 7, 8, 6, 8, 13, 11, 1, 28, 21, 8, 11, 21, 10, 8, 6, 8, 5, 16, 4, 11, 21, 8, 1, 6, 8, 8, 2, 26, 6, 21, 7, 8, 20, 12, 7, 21, 13 (list; graph; listen)
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(8))(n): seq (a(n), n=1..100);

CROSSREFS

8th column of A144871. Cf. A007318.

Sequence in context: A057021 A152443 A119804 this_sequence A058564 A087157 A138618

Adjacent sequences: A144866 A144867 A144868 this_sequence A144870 A144871 A144872

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research