Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111142
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111142 GCD(n,A113222(n)). +0
1
1, 1, 1, 1, 5, 3, 1, 1, 1, 2, 1, 1, 1, 14, 1, 1, 1, 1, 1, 4, 3, 2, 1, 1, 25, 26, 1, 4, 1, 2, 1, 1, 1, 34, 1, 1, 1, 2, 1, 2, 1, 2, 1, 4, 3, 46, 1, 1, 1, 2, 3, 4, 1, 3, 1, 2, 1, 2, 1, 10, 1, 2, 1, 1, 1, 2, 1, 4, 3, 1, 1, 1, 1, 74, 3, 4, 1, 2, 1, 16, 1, 2, 1, 6, 1, 86, 1, 22, 1, 10, 1, 4, 3, 94, 1, 1, 1, 2, 3 (list; graph; listen)
OFFSET

1,5

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

12 = 2^2 * 3^1. So a(12) = GCD(12, F(2^2) + F(3^1)) = GCD(12, 5) = 1.

MATHEMATICA

f[n_] := GCD[n, Plus @@ (Fibonacci[ #[[1]]^#[[2]]] & /@ FactorInteger[n])]; Table[ f[n], {n, 99}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A113222.

Sequence in context: A065469 A126853 A132199 this_sequence A159671 A094853 A096937

Adjacent sequences: A111139 A111140 A111141 this_sequence A111143 A111144 A111145

KEYWORD

nonn

AUTHOR

Leroy Quet Oct 18 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 21 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research