Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126597
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126597 Triangle read by rows: Start with the row 1,2. To get the next row, do the following: if the sum of two adjacent terms is odd then insert this sum in between them, otherwise insert the absolute value of their difference; repeat the procedure. +0
1
1, 2, 1, 3, 2, 1, 2, 3, 5, 2, 1, 3, 2, 5, 3, 2, 5, 7, 2, 1, 2, 3, 5, 2, 7, 5, 2, 3, 5, 2, 7, 5, 2, 7, 9, 2, 1, 3, 2, 5, 3, 2, 5, 7, 2, 9, 7, 2, 5, 7, 2, 5, 3, 2, 5, 7, 2, 9, 7, 2, 5, 7, 2, 9, 7, 2, 9, 11, 2, 1, 2, 3, 5, 2, 7, 5, 2, 3, 5, 2, 7, 5, 2, 7, 9, 2, 11, 9, 2, 7, 9, 2, 7, 5, 2, 7, 9, 2, 7, 5, 2, 3, 5, 2, 7 (list; graph; listen)
OFFSET

1,2

COMMENT

Triangle begins:

1,2

1,3,2

1,2,3,5,2

1,3,2,5,3,2,5,7,2

1,2,3,5,2,7,5,2,3,5,2,7,5,2,7,9,2

1,3,2,5,3,2,5,7,2,9,7,2,5,7,2,5,3,2,5,7,2,9,7,2,5,7,2,9,7,2,9,11,2

FORMULA

{s(i),s(i+1)} => {s(i),s(i)+s(i+1), s(i+1)}, if s(i)+s(i+1) is odd, otherwise {s(i),s(i+1)} => {s(i), abs(s(i)-s(i+1)), s(i+1)}.

MATHEMATICA

s={1, 2}; Do[t=s; ti=1; Do[If[OddQ[su=s[[i]]+s[[i+1]]], t=Insert[t, su, i+ti], t=Insert[t, Abs[s[[i]]-s[[i+1]]], i+ti]]; ti++, {i, Length[s]-1}]; Print[t]; s=t, {8}]

CROSSREFS

Sequence in context: A023510 A005678 A114905 this_sequence A076081 A107338 A118123

Adjacent sequences: A126594 A126595 A126596 this_sequence A126598 A126599 A126600

KEYWORD

nonn,tabf

AUTHOR

Zak Seidov (zakseidov(AT)gmail.com), Mar 13 2007

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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research