This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060355 Numbers n such that n and n+1 are a pair of consecutive powerful numbers. 10


%S 8,288,675,9800,12167,235224,332928,465124,1825200,11309768,384199200,

%T 592192224,4931691075,5425069447,13051463048,221322261600,

%U 443365544448,865363202000,8192480787000,11968683934831,13325427460800,15061377048200,28821995554247

%N Numbers n such that n and n+1 are a pair of consecutive powerful numbers.

%C "Erdos conjectured in 1975 that there do not exist three consecutive powerful integers." - Guy

%C 1825200 belongs to the sequence because 1825200=, 1825201=^2 and both are powerful numbers. - _Labos Elemer_, May 03 2001.

%C See Guy for Erdos' conjecture and statement that this sequence is infinite. - Jud McCranie , Oct 13 2002

%C It is easy to see that this sequence is infinite: if n is in the sequence, so is 4*n*(n+1). [From Franklin T. Adams-Watters, Sep 16 2009]

%C The first of a run of three consecutive powerful numbers (conjectured to be empty) are just those in this sequence and A076445. - _Charles R Greathouse IV_, Nov 16 2012

%C Jaroslaw Wroblewski (see primepuzzles link) shows that there are infinitely many terms in this sequence such that neither a(n) nor a(n+1) is a square. - _Charles R Greathouse IV_, Nov 19 2012

%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 288, pp 74, Ellipses, Paris 2008.

%D R. K. Guy, Unsolved Problems in Number Theory, B16

%H Donovan Johnson, <a href="/A060355/b060355.txt">Table of n, a(n) for n = 1..39</a> (terms < 10^22)

%H C. K. Caldwell, <a href="http://primes.utm.edu/glossary/page.php?sort=PowerfulNumber">Powerful Numbers</a>

%H primepuzzles, <a href="http://www.primepuzzles.net/problems/prob_053.htm">Problem 53. Powerful numbers revisited</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PowerfulNumber.html">Powerful numbers</a>

%t f[n_]:=First[Union[Last/@FactorInteger[n]]];Select[Range[2000000],f[#]>1&&f[#+1]>1&] (* _Vladimir Joseph Stephan Orlovsky_, Jan 29 2012 *)

%o (PARI) is(n)=ispowerful(n)&&ispowerful(n+1) \\ _Charles R Greathouse IV_, Nov 16 2012

%o (Haskell)

%o import Data.List (elemIndices)

%o a060355 n = a060355_list !! (n-1)

%o a060355_list = map (a001694 . (+ 1)) $ elemIndices 1 a076446_list

%o -- _Reinhard Zumkeller_, Nov 30 2012

%Y Primitive elements are in A199801.

%Y Cf. A001694, A060859.

%Y Cf. A076446 (first differences of A001694).

%K nonn

%O 1,1

%A Jason Earls (zevi_35711(AT)yahoo.com), Apr 01 2001

%E Corrected and extended by _Jud McCranie_, Jul 08 2001

%E More terms from _Jud McCranie_, Oct 13 2002

%E a(22)-a(23) from _Donovan Johnson_, Jul 29 2011

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

Content is available under The OEIS End-User License Agreement .

Last modified January 26 11:35 EST 2015. Contains 253668 sequences.