Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125284
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125284 Lower indices of duplicate terms in A125204, i.e. k such that A125204(k) = A125204(k + 1). +0
1
3, 18, 35, 37, 148, 741, 752, 6814, 13976, 150095, 517213, 11874105 (list; graph; listen)
OFFSET

1,1

EXAMPLE

18 is in the sequence because A125204(18) = A125204(19) = 266.

MATHEMATICA

l = {0, 1}; Do[x = l[[n]] + l[[Mod[l[[n]], n] + 1]]; If[x == l[[n]], Print[n - 1]]; AppendTo[l, x], {n, 2, 10^9}]

CROSSREFS

Cf. A125204.

Sequence in context: A047714 A108169 A063116 this_sequence A097989 A039700 A069147

Adjacent sequences: A125281 A125282 A125283 this_sequence A125285 A125286 A125287

KEYWORD

hard,more,nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), Jan 25 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research