id:A064683 - OEIS Search Results

Search: id:A064683

Displaying 1-1 of 1 results found.

page 1

Let n(s) be the number formed from n by inserting s 0's between each digit, e.g. 123(2) is 1002003; sequence gives numbers n such that n(s) is divisible by n for some s>0.

+0
4

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 26, 27, 28, 29, 30, 31, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 77, 78, 79, 80, 81, 82, 83, 84, 85 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`If n=d(v)10^v + d(v-1)10^(v-1) .. + d(1)10+d(0) then n(s) = d(v)10^(v(1+s))+d(v-1)10^(v-1)(1+s)+ .. + d(1)10^(1+s)+d(0); e.g. 123(2) is 110^(23)+ 210^(13)+310^(03) = 1002003.`
	EXAMPLE	`a(12) = 13 because 13(6) = 10,000,003 which is divisible by 13`
	CROSSREFS	`Cf. A064695, A064696, A064697, A064698.` `Sequence in context: A102466 A084176 A059389 this_sequence A084384 A119885 A007964` `Adjacent sequences: A064680 A064681 A064682 this_sequence A064684 A064685 A064686`
	KEYWORD	`base,nonn`
	AUTHOR	`Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 10 2001`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research