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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079009 a(n) = smallest number such that the 2^n successive values of Phi[n+j] (j=0,..2^n-1) are all distinct. 0
1, 2, 11, 37, 149, 1359, 14130, 175327, 1218073, 108387730, 14305141265 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..10.

FORMULA

a(n)=A079008[2^n]

EXAMPLE

n=7: a(n)=175327 means that Phi[175327+j], for j=0,...,127 are all distinct: {175326,87648,...,175452,85320}.

CROSSREFS

Cf. A079008, A079007, A048892.

Sequence in context: A178138 A220888 A038607 * A097651 A059673 A196701

Adjacent sequences:  A079006 A079007 A079008 * A079010 A079011 A079012

KEYWORD

more,nonn

AUTHOR

Labos Elemer, Jan 10 2003

EXTENSIONS

a(8)-a(9) from Donovan Johnson, Oct 27 2008

a(10) from Donovan Johnson, Nov 13 2010

STATUS

approved

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 April 17 14:34 EDT 2014. Contains 240646 sequences.