cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A064683 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.

Original entry on oeis.org

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
Offset: 1

Views

Author

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 10 2001

Keywords

Comments

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 1*10^(2*3)+ 2*10^(1*3)+3*10^(0*3) = 1002003.

Examples

			a(12) = 13 because 13(6) = 10,000,003 which is divisible by 13
		

Crossrefs