Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049077
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049077 a(n)=n/b(n), where b(n)=GCD[n,C(n,[n/2])]. +0
5
1, 1, 1, 2, 1, 3, 1, 4, 1, 5, 1, 1, 1, 7, 1, 8, 1, 9, 1, 5, 1, 11, 1, 6, 1, 13, 1, 7, 1, 1, 1, 16, 1, 17, 1, 3, 1, 19, 1, 2, 1, 7, 1, 11, 1, 23, 1, 4, 1, 25, 1, 13, 1, 27, 1, 1, 1, 29, 1, 15, 1, 31, 1, 32, 1, 11, 1, 17, 1, 5, 1, 18, 1, 37, 1, 19, 1, 39, 1, 4, 1, 41, 1, 1, 1, 43, 1, 11, 1, 1, 1, 23 (list; graph; listen)
OFFSET

0,4

EXAMPLE

for odd n, a(n)=1, for even n, a(n) is either n/2 or smaller, e.g. for n=12, GCD[12,C(12,6)]=GCD[12,924]=12 so a(12)=1

CROSSREFS

Cf. A001405.

Sequence in context: A102613 A097019 A085343 this_sequence A077609 A077610 A007879

Adjacent sequences: A049074 A049075 A049076 this_sequence A049078 A049079 A049080

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 13 2000

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