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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A261342 Numbers n such that either floor(n^(1/k)) or ceiling(n^(1/k)) divides n for all integer k>=1. 4
1, 2, 3, 4, 6, 8, 9, 12, 15, 16, 20, 24, 30, 36, 42, 48, 56, 63, 64, 72, 80, 90, 100, 120, 132, 144, 156, 168, 195, 210, 224, 240, 288, 324, 360, 400, 420, 440, 528, 552, 576, 600, 624, 675, 702, 756, 840, 870, 900, 930, 960, 1056, 1155, 1260, 1332, 1368, 1560, 1680, 1764, 1848, 1980, 2352, 2600, 2704 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Largest known term is a(278) = 8947091986560.

If exists, a(279) > 10^16.

Is this sequence finite?

LINKS

Max Alekseyev, Table of n, a(n) for n = 1..278

PROG

(PARI) { isA261342(n) = my(k, t1, t2); k=2; until(t2<=2, t1=floor(sqrtn(n+.5, k)); t2=ceil(sqrtn(n-.5, k)); if(n%t1 && n%t2, return(0)); k++); 1; }

CROSSREFS

Contains A261205, A261206, A261341 as subsequences.

Subsequence of A006446.

Sequence in context: A231404 A097273 A006446 * A002348 A019469 A081491

Adjacent sequences:  A261339 A261340 A261341 * A261343 A261344 A261345

KEYWORD

nonn,more

AUTHOR

Max Alekseyev, Aug 15 2015

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 23 18:42 EDT 2017. Contains 286926 sequences.