A114011 -id:A114011 - cp's OEIS frontend

A114012 Least multiple of prime(n) ending in digits of n.

14, 55, 26, 17, 38, 69, 2610, 2511, 2812, 3813, 4214, 2115, 3816, 3717, 2318, 3819, 1420, 5621, 1422, 6723, 1424, 2425, 2626, 927, 428, 8829, 1130, 6731, 9432, 1233, 834, 2235, 5436, 6437, 4238, 2839, 13840, 14141, 14842, 13943, 1544, 16745, 10746

Offset: 4

Amarnath Murthy, Nov 12 2005

			a(11) =2511 is a multiple of prime(11)=31.

Cf. A114011.

f[n_] := Block[{k = 1, p = Prime[n], m = 10^Floor[Log[10, n] + 1]}, While[ Mod[k*p, m] != n, k++ ]; k*p]; Table[ f[n], {n, 4, 46}] (* Robert G. Wilson v *)

More terms from Robert G. Wilson v, Nov 17 2005

A114013 Least multiple of prime(n) ending in digit 9.

Original entry on oeis.org

49, 99, 39, 119, 19, 69, 29, 279, 259, 369, 129, 329, 159, 59, 549, 469, 639, 219, 79, 249, 89, 679, 909, 309, 749, 109, 339, 889, 1179, 959, 139, 149, 1359, 1099, 489, 1169, 519, 179, 1629, 1719, 579, 1379, 199, 1899, 669, 1589, 229, 699, 239, 2169, 2259

Offset: 4

Amarnath Murthy, Nov 12 2005

Subsidiary sequences: (1) least multiple of prime(n) ending in 2 or 3 or ..., or 8; (2) divide the above sequences by prime(n).

Cf. A114011, A114012.

f[n_] := Block[{k = 1, p = Prime[n]}, While[Mod[k*p, 10] != 9, k++ ]; k*p]; Table[ f[n], {n, 4, 54}] (* Robert G. Wilson v, Nov 17 2005 *)

a(n) = my(p=prime(n), k=1); while(((k*p) % 10) != 9, k++); k*p; \\ Michel Marcus, Jan 29 2023

More terms from Robert G. Wilson v, Nov 17 2005

cp's OEIS Frontend

A114012 Least multiple of prime(n) ending in digits of n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Extensions