Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116373
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116373 Number of partitions of n into parts with digital root = 3. +0
11
0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 3, 0, 0, 4, 0, 0, 4, 0, 0, 5, 0, 0, 6, 0, 0, 7, 0, 0, 8, 0, 0, 10, 0, 0, 11, 0, 0, 13, 0, 0, 15, 0, 0, 17, 0, 0, 19, 0, 0, 23, 0, 0, 26, 0, 0, 29, 0, 0, 33, 0, 0, 38, 0, 0, 42, 0, 0, 48, 0, 0, 54, 0, 0, 61, 0, 0, 68, 0, 0, 77, 0, 0, 85, 0, 0, 96 (list; graph; listen)
OFFSET

1,12

COMMENT

a(n) = A114102(n) - A116371(n) - A116372(n) - A116374(n) - A116375(n) - A116376(n) - A116377(n) - A116378(n) - A114099(n).

LINKS

Eric Weisstein's World of Mathematics, Digital Root

FORMULA

a(n) = A035382(floor(n/3))*0^(n mod 3).

EXAMPLE

a(21) = #{21, 12+3+3+3, 3+3+3+3+3+3+3} = 3.

CROSSREFS

Cf. A010888.

Sequence in context: A139032 A095808 A079807 this_sequence A096142 A033719 A024164

Adjacent sequences: A116370 A116371 A116372 this_sequence A116374 A116375 A116376

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 12 2006

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research