login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086809 Indices k where A057176(k) = 2. 1

%I #10 Mar 23 2024 20:27:23

%S 2,5,8,34,65,144,296,401,490,520,2165,3590,4640,4828,6828,8704,17675,

%T 21164,52883,84762,162069,358838,1463826,1593474,1668393,2086706,

%U 4364420,20471838,31960444

%N Indices k where A057176(k) = 2.

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

%C No more terms < 3870000. - _David Wasserman_, Mar 31 2005

%t 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}]

%Y Cf. A057176, A087045.

%K nonn,more

%O 1,1

%A _Farideh Firoozbakht_, Aug 05 2003

%E Extended by _Robert G. Wilson v_, Aug 07 2003

%E More terms from _David Wasserman_, Mar 31 2005

%E a(27)-a(29) from _Michael S. Branicky_, Mar 23 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)