Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109641
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109641 Composite n such that binomial(3n, n) == 3^k (mod n) for some integer k > 0. +0
3
4, 9, 15, 25, 27, 36, 49, 57, 75, 81, 121, 125, 132, 138, 153, 155, 169, 289, 324, 343, 361, 529, 552, 765, 791, 841, 961 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

In[1]:= Do[If[ !PrimeQ[n] && IntegerQ[FullSimplify[Log[Mod[Binomial[3*n, n], n]] / Log[3]]], Print[n]], {n, 1, 10^3}]

CROSSREFS

Cf. A080469, A109642.

Sequence in context: A004629 A065893 A052116 this_sequence A134675 A050530 A102084

Adjacent sequences: A109638 A109639 A109640 this_sequence A109642 A109643 A109644

KEYWORD

nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), Aug 05 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research