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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141839 a(n) = first term that can be reduced in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n), such that b is always 5 so that each interpretation is base 6. Terms already fully reduced (i.e. single digits) are excluded. 6
15, 55, 325, 32501, 410245, 145055113 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

It is sometimes possible to compute additional terms by taking the last term, treating it as base 10 and converting to base 6. This may create a term minimally interprettable as base 6 which can converted back to base 10 yielding the previous term in the sequence which will itself yield N further terms. But there is no guarantee (except in base 2) that the term so derived will be the first term to produce a sequence of N+1 terms. There could be another, smaller, term which satisfies that requirement but which uses different terms. Pushing the last term of this sequence does not produce a value minimally interprettable as base 6.

EXAMPLE

a(3) = 325 because 325 is the first number that can produce a sequence of three terms by repeated interpetation as a base 6 number: [325] (base-6) --> [125] (base-6) --> [53] (base-6) --> [33]. Since 33 cannot be interpretted as a base 6 number, the sequence terminates with 53. a(1) = 15 because 15 is the first number that can be reduced once, yielding no further terms minimally interprettable as base 6.

CROSSREFS

Cf. A091049, A141836, A141837, A141838, A141840, A141841, A141842.

Sequence in context: A119134 A119658 A072745 * A080698 A082235 A104724

Adjacent sequences:  A141836 A141837 A141838 * A141840 A141841 A141842

KEYWORD

base,more,nonn

AUTHOR

Chuck Seggelin (seqfan(AT)plastereddragon.com), Jul 10 2008

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 16 21:51 EST 2012. Contains 205978 sequences.