login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112014 Numbers n with odd length such that n = d_1+(d_2^d_3)+ ...+(d_(k-1)^d_k) where d_1 d_2 ... d_k is the decimal expansion of n. 2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 736, 15642, 15662, 1680129, 1686394 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..15.

EXAMPLE

1686394 is in the sequence (the largest term) because 1686394=1+(6^8)+(6^3)+(9^4).

MATHEMATICA

Do[h=IntegerDigits[n]; k=Length[h]; If[ OddQ[k] && Select[ Range[k/2], h[[2# ]] ==0== h[[2#+1]] &]=={} && n==h[[1]]+ Sum[h[[2j]]^h[[2j+1]], {j, k/2}], Print[n]], {n, 10^9}]

olQ[n_]:=Module[{idn=IntegerDigits[n], d2}, d2=Partition[Rest[idn], 2]; OddQ[ Length[ idn]]&&FreeQ[d2[[All, 2]], 0]&&Total[#[[1]]^#[[2]]&/@d2]+ idn[[1]] == n]; Join[{0}, Select[Range[169*10^4], olQ]] (* Harvey P. Dale, Jul 09 2019 *)

CROSSREFS

Cf. A112015, A112016.

Sequence in context: A308126 A124107 A257275 * A145461 A075154 A187924

Adjacent sequences:  A112011 A112012 A112013 * A112015 A112016 A112017

KEYWORD

base,fini,full,nonn

AUTHOR

Farideh Firoozbakht, Sep 15 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 16:05 EDT 2020. Contains 335729 sequences. (Running on oeis4.)