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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130181 Largest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists. 4
486, 1215, 4374, 4672, 12862, 12649, 23408, 32761, 47477, 56852, 59048, 90746, 116864, 112346, 139472, 149705, 190512, 234247, 254015, 0, 322322, 331775, 391238, 446512, 454951, 546121, 530145, 316250, 613927, 763795, 786664, 809936 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Klaus Brockhaus, Table of n, a(n) for n=1..54

EXAMPLE

For n = 2 the largest such k is 1215: 1215^2 = 1476225 and 1+4+7+6+2+2+5 = 27; 1215^3 = 1793613375and 1+7+9+3+6+1+3+3+7+5 = 45; 27*45 = 1215. Hence a(2) = 1215.

CROSSREFS

Cf. A126783 (smallest k), A130179 (upper bound), A130180 (number of such k).

Sequence in context: A156774 A097767 A031520 * A158325 A187860 A205240

Adjacent sequences:  A130178 A130179 A130180 * A130182 A130183 A130184

KEYWORD

nonn,base

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 14 2007

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 17:33 EST 2012. Contains 205644 sequences.