Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123872 Start with the seed a(0)=2. The minimum number, different from 1, that multiplied by 2 (seed) produces a number with 2 as its rightmost digit is a(1)=6. Then 6*2=12. Again, the minimum number that multiplied by 12 produces 12 as its rightmost digits is a(2)=26 (12*26=312). And so on. +0
4
2, 6, 26, 126, 6251, 62500001 (list; graph; listen)
OFFSET

0,1

EXAMPLE

a(0)=2

a(1)=6 because 2*6 = 12

a(2)=26 because 12*26 = 312

a(3)=126 because 312*126 = 39312

a(4)=6251 because 39312*6251 = 245739312

a(5)=62500001 because 245739312*62500001 = 15358707245739312

MAPLE

P:=proc(n) local i, j, k; k:=0; j:=n; while j>0 do j:=trunc(j/10); k:=k+1; od; for i from 2 by 1 to n^2 do j:=((n*(i-1)) mod (10^k)); if j=0 then print(i, n*i); break; fi; od; end: P(312);

CROSSREFS

Adjacent sequences: A123869 A123870 A123871 this_sequence A123873 A123874 A123875

Sequence in context: A114710 A092880 A034474 this_sequence A030937 A030827 A030947

KEYWORD

nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Oct 16 2006

page 1

Search completed in 0.002 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research