Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087471
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087471 Final digit resulting from iterations of the product of the two numbers formed from the alternating digits of n. +0
5
1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 4, 6, 8, 0, 2, 4, 6, 8, 0, 3, 6, 9, 2, 5, 8, 2, 8, 4, 0, 4, 8, 2, 6, 0, 8, 6, 6, 8, 0, 5, 0, 5, 0, 0, 0, 5, 0, 0, 0, 6, 2, 8, 8, 0, 8, 8, 6, 0, 0, 7, 4, 2, 6, 5, 8, 8, 0, 8, 0, 8, 6, 8, 6, 0, 6, 0, 8, 4, 0, 9, 8, 4, 8, 0, 0, 8, 4, 8, 0, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,2

COMMENT

A087472(n) gives the number of iterations required for Murthy's function, f(n), to reach a single digit. A087473(n) gives the smallest number that requires n iterations of Murthy's function to reach a single digit. The n-th row of triangle A087474 gives the n successive iterations of Murthy's function on A087473(n).

FORMULA

a(n) = a(f(n)), where f(n) is Murthy's function: f(1234)=13*24=312, f(12345)=135*24=3240, f(123456)=135*246=33210.

EXAMPLE

a(1234) = a(13*24) = a(312) = a(32*1) = a(32) = a(3*2) = 6.

CROSSREFS

Cf. A087472, A087473, A087474.

Adjacent sequences: A087468 A087469 A087470 this_sequence A087472 A087473 A087474

Sequence in context: A010879 A062078 A031347 this_sequence A128212 A007954 A079475

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Paul D. Hanna (pauldhanna(AT)juno.com), Sep 11 2003

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research