A069530 -id:A069530 - cp's OEIS frontend

A069536 Smallest multiple of 8 with digit sum n.

0, 1000, 200, 120, 40, 32, 24, 16, 8, 72, 64, 56, 48, 184, 176, 96, 88, 296, 288, 496, 488, 696, 688, 896, 888, 1888, 2888, 3888, 4888, 5888, 6888, 7888, 8888, 9888, 19888, 29888, 39888, 49888, 59888, 69888, 79888, 89888, 99888

Offset: 0

Amarnath Murthy, Apr 01 2002

a(25) onwards the pattern is evident.

Cf. A069521 to A069530, A069532, A069533, A069534, A069535.

a069536 n = a069536_list !! n
a069536_list = map (* 8) a077495_list
-- Reinhard Zumkeller, Dec 09 2011

a(n) = 8 * A077495(n).

Missing a(0) inserted by Franklin T. Adams-Watters, Nov 29 2011

A069531 Smallest positive k such that 10^k + 1 is divisible by n, or 0 if no such number exists.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 3, 0, 0, 0, 8, 0, 9, 0, 0, 0, 11, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 22, 0, 3, 0, 0, 0, 0, 0, 48, 0, 0, 0, 2

Offset: 1

Amarnath Murthy, Apr 01 2002

nonn

When a(n) is not zero, it is a divisor of phi(n). If n is a prime with primitive root 10 (cf. A001913) then a(n) = (n-1)/2.

			a(7) = a(13) = 3 as 1001 is divisible by 7 and 13. a(17) = 8 as 17 divides 100000001 = 10^8 + 1.

Antti Karttunen, Table of n, a(n) for n = 1..10001

Cf. A069521 to A069530.

Cf. A000010, A001913, A002329.

A069531(n) = { fordiv(eulerphi(n),k,if(!((1+(10^k))%n),return(k))); (0); }; \\ Antti Karttunen, Aug 23 2019

More terms from Vladeta Jovovic, Apr 03 2002

cp's OEIS Frontend

A069536 Smallest multiple of 8 with digit sum n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Haskell

Formula

Extensions