Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049586
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049586 GCD of cototients(A051953) of pairs of consecutive integers. +0
4
1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 3, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 3, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3 (list; graph; listen)
OFFSET

0,9

FORMULA

a(n) = GCD[w+1-Phi[w+1], w-Phi[w]] = GCD[A051953(w+1), A051953(w)] Most of the terms are 1.

EXAMPLE

n = 9: a(9) = GCD[10-Phi(10), 9-Phi(9)] = GCD[6, 3] = 3. n = 10: a(10) = GCD[11-Phi(11), 10-Phi(10)] = GCD[1, 6] = 1

CROSSREFS

Cf. A000010, A051953, A058515.

Sequence in context: A030578 A030577 A070670 this_sequence A133721 A083202 A030560

Adjacent sequences: A049583 A049584 A049585 this_sequence A049587 A049588 A049589

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 28 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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research