login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154820 Numbers whose trajectory under iteration of sum of cubes of digits eventually turns out to follow the cyclic iteration of 133, 55, 250. 4

%I #14 Jan 07 2019 04:20:21

%S 4,13,25,28,31,40,46,52,55,64,82,103,130,133,205,208,250,256,265,280,

%T 289,298,301,310,313,331,349,394,400,406,439,448,460,484,493,502,505,

%U 520,526,550,562,589,598,604,625,640,652,679,697,769,796,802,820,829

%N Numbers whose trajectory under iteration of sum of cubes of digits eventually turns out to follow the cyclic iteration of 133, 55, 250.

%C All the numbers are of the form 3n+1.

%C Subsequence of A165336. - _Reinhard Zumkeller_, Sep 17 2009

%e Taking 40 for example,

%e 4^3 + 0^3 = 64;

%e 6^3 + 4^3 = 280;

%e 2^3 + 8^3 + 0^3 = 520;

%e 5^3 + 2^3 + 0^3 = 133;

%e 1^3 + 3^3 + 3^3 = 55;

%e 5^3 + 5^3 = 250.

%p A055012 := proc(n) local a,d ; a := 0 ; for d in convert(n,base,10) do a := a+d^3; od; a ; end: isA154820 := proc(n) local traj,t ; t := n ; traj := {} ; while true do if t in traj then if t in {133,55,250} then RETURN(true) ; else RETURN(false) ; fi; else traj := traj union {t} ; t := A055012(t) ; fi; od: end: for n from 1 to 1000 do if isA154820(n) then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jan 18 2009

%Y Cf. A165337, A154877, A165336, A165339.

%K nonn,base

%O 1,1

%A Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 15 2009

%E Extended by _R. J. Mathar_, Jan 18 2009

%E Edited by _Charles R Greathouse IV_, Aug 02 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:57 EDT 2024. Contains 371265 sequences. (Running on oeis4.)