Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135760
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135760 Least number in A001764 divisible by 3^n: a(n) = A001764(3^n-1). +0
1
1, 3, 43263, 6568517413771094628, 748787983804424579516665098357127267955239740580277791815018327 (list; graph; listen)
OFFSET

0,2

COMMENT

Only numbers in A001764 not divisible by 3 are: A001764((3^n-1)/2) for n>=0.

FORMULA

a(n) = C(3^(n+1)-3, 3^n-1) / (2*3^n-1).

PROGRAM

(PARI) a(n)=binomial(3^(n+1)-3, 3^n-1)/(2*3^n-1)

CROSSREFS

Cf. A001764; A135759.

Adjacent sequences: A135757 A135758 A135759 this_sequence A135761 A135762 A135763

Sequence in context: A086509 A068161 A116313 this_sequence A003541 A086829 A115976

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 02 2007

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research