Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106848 a(n) = the number of times the last digit of n must be appended to n to form a number m such that n divides m, or 0 if no such m exists. +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 6, 6, 3, 0, 16, 9, 18, 1, 6, 2, 22, 0, 0, 6, 27, 6, 28, 1, 15, 0, 2, 16, 6, 0, 3, 18, 6, 1, 5, 6, 21, 2, 9, 22, 46, 0, 42, 1, 48, 0, 13, 27, 2, 0, 18, 28, 58, 1, 60, 15, 6, 0, 6, 2, 33, 16, 22, 1, 35, 0, 8, 3, 0, 0, 2, 6, 13, 1, 81, 5, 41, 6, 16, 21, 84, 2, 44, 1 (list; graph; listen)
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research