login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110405 A110404(k)/k where k is the corresponding number == 1,3,7 or 9 (mod 10). 1
1, 1, 1, 1, 1, 24087, 421865715983363, 48378522062732589, 5772, 140535792709705753184, 26936, 320445837687216997561825148, 4235907461713913326816552623, 1, 19929, 24087, 34491254 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

a(A002113(n)) = 1, for n>1.

EXAMPLE

The term corresponding to 13 is 24087 =313131/13.

MATHEMATICA

f[n_] := Block[{k = 1, id = Reverse[ IntegerDigits[n]]}, While[fd = FromDigits[ Flatten[ Table[id, {k}]]]; Mod[fd, n] != 0, k++ ]; fd/n]; lst = Select[ Range[1, 45, 2], Mod[ #, 5] != 0 &]; f /@ lst (* Robert G. Wilson v *)

CROSSREFS

Cf. A110404.

Sequence in context: A204359 A084691 A084692 * A078870 A154069 A194721

Adjacent sequences:  A110402 A110403 A110404 * A110406 A110407 A110408

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 30 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Jul 30 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:09 EST 2012. Contains 205614 sequences.