Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080390
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080390 Least x such that GCD[A001405(x+1), A001405(x)]=n. +0
1
1, 5, 14, 27, 34, 11, 62, 183, 98, 39, 142, 107, 220, 69, 44, 495, 322, 143, 436, 139, 482, 637, 574, 119, 674, 233, 782, 55, 898, 29, 1146, 4063, 230, 441, 174, 467, 1516, 493, 662, 239, 1762, 377, 2020, 175, 764, 781, 2302, 2543, 2596, 949, 968, 207, 3126, 1241 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=Min{x; A080388(x)=n}

MATHEMATICA

f[x_] := GCD[Binomial[x+1, Floor[x+1/2]], Binomial[x, Floor[x/2]]] t=Table[0, {257}]; Do[s=f[n]; If[s<258&&t[[s]]==0, t[[s]]=n], {n, 1, 10000}]; t

CROSSREFS

Cf. A001405, A080388, A080389.

Sequence in context: A018829 A070133 A066479 this_sequence A030745 A071421 A065351

Adjacent sequences: A080387 A080388 A080389 this_sequence A080391 A080392 A080393

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 12 2003

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research