Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109903
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109903 Let c = composite(n) & p = prime(n); a(n) = binomial( max(c,p), min(c,p) ). +0
1
6, 20, 56, 36, 11, 13, 680, 3876, 245157, 34597290, 84672315, 12875774670, 244662670200, 800472431850, 14833897694226, 973469712824056, 48402641245296107, 191724747789809255, 9989690752182277136 (list; graph; listen)
OFFSET

1,1

COMMENT

11 and 13 are the only prime terms. For a(7) onwards sequence is monotonically increasing.

EXAMPLE

a(3) = C(8,5) = 56, a(8) = C(19,15) =3876.

MATHEMATICA

Composite[ n_Integer ] := Block[{k = n + PrimePi[ n ] + 1}, While[ k != n + PrimePi[ k ] + 1, k++ ]; k]; f[n_] := Block[{a = Sort[{Composite[n], Prime[n]}]}, Binomial[Last[a], First[a]]]; Table[ f[n], {n, 19}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Jul 16 2005)

CROSSREFS

Sequence in context: A028492 A059822 A152959 this_sequence A014480 A048778 A048611

Adjacent sequences: A109900 A109901 A109902 this_sequence A109904 A109905 A109906

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 14 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Jul 16 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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research