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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151764 a(n) = f(f(n)), where f(n) = A071786(n). 3

%I

%S 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,217,20,21,22,32,24,25,

%T 26,27,28,128,30,31,32,33,34,35,36,37,434,39,40,14,42,142,44,45,64,

%U 146,48,49,50,51,52,35,54,55,56,651,256,455,60,16,62,63,64,65,66,364,68,96,70

%N a(n) = f(f(n)), where f(n) = A071786(n).

%C Completely multiplicative.

%H Reinhard Zumkeller, <a href="/A151764/b151764.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Di#divseq">Index to divisibility sequences</a>

%o (Haskell)

%o a151764 = a071786 . a071786 -- _Reinhard Zumkeller_, Oct 14 2011

%o (PARI) rev(n)=fromdigits(Vecrev(digits(n)))

%o A071786(n)=my(f=factor(n)); prod(i=1,#f~,rev(f[i,1])^f[i,2])

%o a(n)=A071786(A071786(n)) \\ _Charles R Greathouse IV_, Jun 28 2015

%K nonn,base,mult

%O 1,2

%A _N. J. A. Sloane_, Jun 22 2009, Jun 23 2009

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 April 18 22:08 EDT 2019. Contains 322237 sequences. (Running on oeis4.)