Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113176
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113176 Product{p|n} F(p), where F(p) is the pth Fibonacci number and where the product is over the distict prime divisors of n. +0
2
1, 1, 2, 1, 5, 2, 13, 1, 2, 5, 89, 2, 233, 13, 10, 1, 1597, 2, 4181, 5, 26, 89, 28657, 2, 5, 233, 2, 13, 514229, 10, 1346269, 1, 178, 1597, 65, 2, 24157817, 4181, 466, 5, 165580141, 26, 433494437, 89, 10, 28657, 2971215073, 2, 13, 5, 3194, 233 (list; graph; listen)
OFFSET

1,3

LINKS

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

FORMULA

Multiplicative with a(p^e) = F(p). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 05 2006

EXAMPLE

63 = 3^2 * 7^1. So a(63) = F(3) * F(7) = 2 * 13 = 26.

MATHEMATICA

b[t_]:=Fibonacci[First[t]] a[n_]:=Apply[Times, Map[b, FactorInteger[n]]] (Peuha)

CROSSREFS

Cf. A113175, A000045.

Sequence in context: A111361 A167160 A082010 this_sequence A113175 A109191 A087123

Adjacent sequences: A113173 A113174 A113175 this_sequence A113177 A113178 A113179

KEYWORD

nonn,mult

AUTHOR

Leroy Quet Oct 16 2005

EXTENSIONS

More terms from Esa Peuha (esa.peuha(AT)helsinki.fi), Oct 26 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research