Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068944
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068944 Highest power of 9 dividing A068943(n) for n>0. +0
1
0, 0, 0, 2, 7, 28, 108, 414, 1585, 6087, 23446, 90532, 350343, 1358437, 5276545, 20527950, 79976007, 311984922, 1218474389, 4763911699, 18643889114, 73029856058, 286302435505, 1123267533520, 4410123312095, 17326303720537 (list; graph; listen)
OFFSET

1,4

COMMENT

Sequence was suggested by the discovery that the digital root of A068943 is 9 for all n>3.

EXAMPLE

a(11)=23446 since f(11,11,11)=9^binomial(12,10) * 6^binomial(15,10) * 3^(18,10) * other terms. this implies a(11)=binomial(12,10) + 1/2*(binomial(15,10)-1 + binomial(18,10)).

CROSSREFS

Cf. A068943, A068945.

Sequence in context: A048504 A092465 A099488 this_sequence A012855 A150646 A128611

Adjacent sequences: A068941 A068942 A068943 this_sequence A068945 A068946 A068947

KEYWORD

nonn

AUTHOR

Francois Jooste (phukraut(AT)hotmail.com), Mar 09 2002

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research