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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132068 Irregular array: row n has A000010(n) terms: the sum of the first m terms of row n is the m-th positive integer which is coprime to n. 0
1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 2, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 4, 2, 2, 1, 1, 2, 3, 1, 3, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 2, 4, 2, 4, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

The first term of each row is 1. The sum of the terms of row n is n-1, for n>=2. After the initial 1, the remaining terms of each row are the same forward or backward.

EXAMPLE

The positive integers which are <= 12 and are coprime to 12 are 1,5,7,11. Row 12 of the array is: 1,4,2,4. So we have: 1=1; 1+4=5; 1+4+2=7; 1+4+2+4=11.

The first 12 rows of the array:

1;

1;

1,1;

1,2;

1,1,1,1;

1,4;

1,1,1,1,1,1;

1,2,2,2;

1,1,2,1,2,1;

1,2,4,2;

1,1,1,1,1,1,1,1,1,1;

1,4,2,4

MATHEMATICA

f[n_] := Block[{g}, g = Select[Range[n], GCD[ #, n] == 1 &]; g - Prepend[Most[g], 0]]; Flatten[Array[f, 25]] (*Chandler*)

CROSSREFS

Cf. A038566, A000010.

Sequence in context: A193518 A060176 A010248 * A173441 A129192 A062540

Adjacent sequences:  A132065 A132066 A132067 * A132069 A132070 A132071

KEYWORD

nonn,tabf

AUTHOR

Leroy Quet, Oct 30 2007

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 01 2007

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

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

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.