Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059409
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059409 4^n (2^n - 1). +0
2
0, 4, 48, 448, 3840, 31744, 258048, 2080768, 16711680, 133955584, 1072693248, 8585740288, 68702699520, 549688705024, 4397778075648, 35183298347008, 281470681743360, 2251782633816064, 18014329790005248, 144114913197948928 (list; graph; listen)
OFFSET

0,2

COMMENT

Jordan's totient functions are described more fully in A059379 and A059380; for example, J_1(n) is Euler's totient function and J_2(n) the Moebius transform of squares.

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

FORMULA

Equals J_n(8) (see A059379).

J_n(8) = 8^n - A024023(n) - A000225(n) - A000012(n)

EXAMPLE

(4,48,448,3840,...) = (8,64,512,4096....) - (2,12,56,240,...) - (1,3,7,15,...) - (1,1,1,1,...)

PROGRAM

(PARI) { for (n = 0, 100, write("b059409.txt", n, " ", 4^n*(2^n - 1)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 26 2009]

CROSSREFS

Cf. A059379, A059380.

Equals 4 * A016152.

Sequence in context: A091904 A158681 A111903 this_sequence A026942 A159903 A099671

Adjacent sequences: A059406 A059407 A059408 this_sequence A059410 A059411 A059412

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Alford Arnold (Alford1940(AT)aol.com), Jan 30 2001

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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research