The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A166667

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A166667

Totally multiplicative sequence with a(p) = 9p+1 for prime p.
(history; published version)

#8 by N. J. A. Sloane at Sun May 22 12:56:47 EDT 2016

STATUS

reviewed

approved

#7 by Michel Marcus at Sun May 22 12:12:54 EDT 2016

STATUS

proposed

reviewed

#6 by G. C. Greubel at Sun May 22 11:27:34 EDT 2016

STATUS

editing

proposed

#5 by G. C. Greubel at Sun May 22 11:27:30 EDT 2016

LINKS

G. C. Greubel, <a href="/A166667/b166667.txt">Table of n, a(n) for n = 1..10000</a>

MATHEMATICA

a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((9*fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n], {n, 1, 100}] (* G. C. Greubel, May 22 2016 *)

STATUS

approved

editing

#4 by Russ Cox at Fri Mar 30 19:00:17 EDT 2012

AUTHOR

_Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), _, Oct 18 2009

Discussion

Fri Mar 30

19:00

OEIS Server: https://oeis.org/edit/global/299

#3 by T. D. Noe at Mon Feb 07 13:36:10 EST 2011

STATUS

proposed

approved

#2 by R. J. Mathar at Mon Feb 07 13:18:13 EST 2011

KEYWORD

nonn,mult

STATUS

approved

proposed

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

NAME

Totally multiplicative sequence with a(p) = 9p+1 for prime p.

DATA

1, 19, 28, 361, 46, 532, 64, 6859, 784, 874, 100, 10108, 118, 1216, 1288, 130321, 154, 14896, 172, 16606, 1792, 1900, 208, 192052, 2116, 2242, 21952, 23104, 262, 24472, 280, 2476099, 2800, 2926, 2944, 283024, 334, 3268, 3304, 315514, 370, 34048, 388

OFFSET

1,2

FORMULA

Multiplicative with a(p^e) = (9p+1)^e. If n = Product p(k)^e(k) then a(n) = Product (9*p(k)+1)^e(k).

KEYWORD

nonn

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Oct 18 2009

STATUS

approved