Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090737
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090737 Triangle of Eulerian numbers modulo 3. +0
1
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 0, 2, 1, 1, 0, 2, 2, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 1, 1, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 1, 0, 2, 2, 0, 0, 0, 0, 2, 2, 0, 1, 1 (list; table; graph; listen)
OFFSET

1,8

PROGRAM

(PARI) T(n, k)=sum(j=0, k, (-1)^j*(k-j)^n*binomial(n+1, j))%3

CROSSREFS

Cf. A008292.

Adjacent sequences: A090734 A090735 A090736 this_sequence A090738 A090739 A090740

Sequence in context: A140751 A104320 A128706 this_sequence A072550 A037810 A038769

KEYWORD

nonn,tabl

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 18 2004

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research