Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085866 a(1) = 3, a(n+1) = a(n)*{phi(a(n))}, where phi(n) is the Euler's coprime function. +0
2
3, 6, 12, 48, 768, 196608, 12884901888, 55340232221128654848, 1020847100762815390390123822295304634368, 347376267711948586270712955026063723559809953996921692118372752023739388919808 (list; graph; listen)
OFFSET

1,1

COMMENT

(1). a(1) = 1, a(n+1) = a(n) + phi(a(n)) gives A074693. (2). for n>1, a(n)/3 is 2^(2^(n-2). And this sequence is; 2,4,16,256,... this is nothing but phi(a(n-1)).

FORMULA

a(n) = 3*2^(2^(n-2)).

EXAMPLE

a(3) = 12 and phi(12)= 4, hence a(4) = 12*4 = 48.

PROGRAM

(PARI) for(n=1, 11, if(n==1, a=3, a*=eulerphi(a)); print(a); )

CROSSREFS

Cf. A074693, A085864, A085865.

Cf. A000215.

Adjacent sequences: A085863 A085864 A085865 this_sequence A085867 A085868 A085869

Sequence in context: A136121 A023369 A129380 this_sequence A139416 A013563 A009788

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 06 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 16 2003

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research