Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062296
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062296 Number of entries in n-th row of Pascal's triangle divisible by 3. +0
2
0, 0, 0, 2, 1, 0, 4, 2, 0, 8, 7, 6, 9, 6, 3, 10, 5, 0, 16, 14, 12, 16, 11, 6, 16, 8, 0, 26, 25, 24, 27, 24, 21, 28, 23, 18, 33, 30, 27, 32, 25, 18, 31, 20, 9, 40, 35, 30, 37, 26, 15, 34, 17, 0, 52, 50, 48, 52, 47, 42, 52, 44, 36, 58, 53, 48, 55, 44, 33, 52, 35, 18, 64, 56, 48, 58, 41 (list; graph; listen)
OFFSET

0,4

FORMULA

a(n) + A006047(n) = n + 1 so a(n) = n + 1 - A006047(n)

EXAMPLE

When n=3 the row is 1,3,3,1 so a(3) = 2.

MAPLE

p:=proc(n) local ct, k: ct:=0: for k from 0 to n do if binomial(n, k) mod 3 = 0 then else ct:=ct+1 fi od: end: seq(n+1-p(n), n=0..83); (Deutsch)

CROSSREFS

Cf. A006047.

Sequence in context: A122792 A139136 A138002 this_sequence A140649 A091453 A062173

Adjacent sequences: A062293 A062294 A062295 this_sequence A062297 A062298 A062299

KEYWORD

nonn

AUTHOR

Ahmed Fares (ahmedfares(AT)my-deja.com), Jul 02 2001

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 03 2005

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research