Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079009
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 2, 11, 37, 149, 1359, 14130, 175327, 1218073, 108387730 (list; graph; listen)
OFFSET

0,2

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: A140561 A140553 A038607 this_sequence A097651 A059673 A166989

Adjacent sequences: A079006 A079007 A079008 this_sequence A079010 A079011 A079012

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 10 2003

EXTENSIONS

a(8)-a(9) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 27 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research