The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A166706

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

#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 R. J. Mathar at Mon Feb 07 13:26:19 EST 2011

STATUS

proposed

approved

#2 by R. J. Mathar at Mon Feb 07 13:26:15 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) = a(p-1) + 9 for prime p.

DATA

1, 10, 19, 100, 109, 190, 199, 1000, 361, 1090, 1099, 1900, 1909, 1990, 2071, 10000, 10009, 3610, 3619, 10900, 3781, 10990, 10999, 19000, 11881, 19090, 6859, 19900, 19909, 20710, 20719, 100000, 20881, 100090, 21691, 36100, 36109, 36190, 36271

OFFSET

1,2

FORMULA

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

KEYWORD

nonn

AUTHOR

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

STATUS

approved