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!)
A225297 Numbers divisible by their last digit cubed. 4
1, 11, 21, 31, 32, 41, 51, 61, 64, 71, 72, 81, 91, 101, 111, 112, 121, 125, 131, 141, 151, 152, 161, 171, 181, 191, 192, 201, 211, 216, 221, 231, 232, 241, 243, 251, 261, 271, 272, 281, 291, 301, 311, 312, 321, 331, 341, 351, 352, 361, 371, 375, 381, 384, 391 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers k such that (k mod 10)^3 | k.
All numbers ending in 1 are trivially included in this sequence.
The sequence is { 1+10k, 32 + 40k, 243 + 270k, 64 + 320k, 125 + 250k, 216 + 1080k, 3087 + 3430k, 2048 + 2560k, 729 + 7290k ; k = 0,1,2,...}. - M. F. Hasler, Jan 31 2016
The asymptotic density of this sequence is 2201597407/16003008000 = 0.137573... . - Amiram Eldar, Aug 08 2023
LINKS
Christian N. K. Anderson, Table of n, a(n) for n = 1..10000
EXAMPLE
a(16) = 112 is divisible by 2^3.
MATHEMATICA
Select[Range[400], (m = Mod[#, 10]) > 0 && Divisible[#, m^3] &] (* Amiram Eldar, Aug 08 2023 *)
PROG
(R) x=0; y=rep(0, 100); len=0; isint<-function(x) x==as.integer(x); while(len<100) if((x=x+1)%%10>0) if(isint(x/(x%%10)^3)) y[(len=len+1)]=x
(PARI) is(n)=n%10&&n%(n%10)^3==0 \\ M. F. Hasler, Jan 31 2016
CROSSREFS
Sequence in context: A308232 A049201 A068633 * A123849 A108812 A216100
KEYWORD
nonn,base
AUTHOR
STATUS
approved

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 April 23 13:11 EDT 2024. Contains 371913 sequences. (Running on oeis4.)