Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086809
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086809 Indices n where A057176(n)=2. +0
2
2, 5, 8, 34, 65, 144, 296, 401, 490, 520, 2165, 3590, 4640, 4828, 6828, 8704, 17675, 21164, 52883, 84762, 162069, 358838, 1463826, 1593474, 1668393, 2086706 (list; graph; listen)
OFFSET

1,1

COMMENT

By definition of the sequence, A087045(n) + 1 for every n > 0 is in the sequence.

No more terms < 3870000. - David Wasserman (wasserma(AT)spawar.navy.mil), Mar 31 2005

MATHEMATICA

a[m_] := a[m] = Sum[ a[j], {j, 0, Mod[ a[m - 1], m]}]; vv = {}; Do[ a[n] = If[ n == 0, 1, b]; v = a[n + 1]; b = v; If[ v == 2, AppendTo[ vv, n + 1]; Print[n + 1]], {n, 0, 165000}]

CROSSREFS

Cf. A057176, A087045.

Sequence in context: A066846 A140275 A025533 this_sequence A153863 A153890 A130378

Adjacent sequences: A086806 A086807 A086808 this_sequence A086810 A086811 A086812

KEYWORD

nonn

AUTHOR

Farideh Firoozbakht (f.firoozbakht(AT)sci.ui.ac.ir), Aug 05 2003

EXTENSIONS

Extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 07 2003

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Mar 31 2005

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 November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research